instruction stringlengths 35 29.1k |
|---|
Given two unbounded knapsack instances, $K_1 = (W_1, weights, values), K_2 = (W_2, weights, values)$, where $W_1 \ne W_2$, what is the complexity of determining $v(K_1) = v(K_2)$ where $v$ returns the optimal sum of values given a knapsack instance?
I know that the decision problem of knapsack -- i.e. asking whether or... |
Let's take a compound propositions
Either it is below freezing or it is snowing.
Now if,
$p$: it is below freezing
$q$: it is snowing
Question Link: https://gateoverflow.in/42720/kenneth-rosen-edition-6th-exercise-1-1-question-7-page-no-17
Will it be $p \vee q$ or $p \oplus q$? There are some instances where semantic... |
If you implement mergesort top-down you can always split the input of length $n$ into one of length $\lfloor n / 2\rfloor$ and one of length $\lceil n / 2 \rceil$. This ensures that all merges are always well-balanced: the left and right inputs differ in length by at most 1.
Is there a way of achieving this property in... |
As a beginner in neural networks, I'm currently working on a project for predicting winning fighters in MMA matches. I understand that this is a complex task due to the nature of the sport.
Currently, I'm achieving an accuracy of 64.2% on my test dataset. My goal is to increase this accuracy to 70%.
The method I'm usin... |
I recently learned about the definition of PSPACE problems, which are a subset of decision problems that can be solved by using polynomial space. However, one thing I don't understand is when I asked my instructor whether any problem, as long as it uses polynomial space to solve, is in PSPACE, and the instructor said y... |
I understand separation logic as a form of verification method, similar to Hoare logic. That is, they allow to reason about statements of the form $\{P\} C \{Q\}$, where $C$ is an instruction, and $P$ is pre-condition, $Q$ a post-condition.
My question is: How is separation logic used in practice? Do we manually derive... |
I was studying pumping lemma for CFL and in the proof it says that, we choose the shortest parse tree if there are multiple parse trees and we also choose $R$ the repeating variable such that it's the lowest in the tree.
It says that it satisfies condition 2 $(|vy| \gt 0)$ & 3 $(|vxy| \leq p)$. I don't understand how.
|
I came across this interesting problem in a test and I couldn't complete it.
There is a string given s which can consists of numbers between 0-9 and '?'. In place of '?' we can insert any of the numbers between 0 to 9. We need to find the number of ways in which it can be done so that no two adjacent numbers are same.
... |
I'm searching for equivalent problem classes from the polynomial hierarchy to function problems. I have this problem similar to traveling salesperson, which imo lies in the second order of polynomial hierarchy. However the existence of an answer can always be answered with yes due to the structure of the problem. There... |
Background
I'm writing algorithms for generating arbitrary strings from a formal language $L \subseteq \Sigma^*$, one symbol at a time from left to right, while also ensuring that the strings do not exceed a given length $N$. My algorithm cannot fail partway and backtrack, i.e. it can't just generate a string from $L$ ... |
I am currently reading Michael Soltys' Analysis of Algorithms (2nd Edition), and Problem 1.13 of the subsection titled Invariance reads:
Let $n$ be an odd number, and suppose that we have the set $\{1,2,\dots,2n\}$. We pick any two numbers $a$, $b$ in the set, delete them from the set, and replace them with $|{a-b}|$.... |
I don't know if this post belongs in this site because I feel it might be a programming question, but also I feel it might be related to the way Color Spaces work, if it does't belong here I can change it. I would like to know how many different HSV colors are possible to generate using OpenCV.
HSV colors are defined b... |
The question asks to write the shortest regular expression possible to the following automaton:
I see only one way to tackle the problem:
Use one of the methods mentioned here How to convert finite automata to regular expressions?
and then get a regular expression.
If for example I use the Transitive closure method, i... |
I want to make a simple C program in order to measure L1, L2 and L3 latencies of my CPU. I know some info about them:
Caches (sum of all):
L1d: 128 KiB (4 instances)
L1i: 256 KiB (4 instances)
L2: 2 MiB (4 instances)
L3: 4 MiB (1 instance... |
in my quest to understand computability theory, I came across this question, and it made me think that I don't fully understand the theory
is this language in R RE or coRE? or neither
$$ L=\{ <M>|M \ Is \ a \ TM \ that \ accepts \ all \ even \ length \ words \} $$
my attempt:
in terms of where intuition this lang... |
I am learning about finite automata and trying to create a machine that matches
{w ∈ Σ∗| w does not contain the substring 10}
I created a DFA where it either starts with 1 or 0. I know it's not the most concise FA, but is it accurate?
|
I originally thought it was 0(01)*(01)0 U 1(01)(01)1 where:
two versions: one that starts and ends with 0, the other that starts and ends with 1
connected by plus, which does not mean union of both but either or
repeat of (01)* to make the string even. For example, for 0010 you would
start with 0
pick 0 from the fir... |
So I am trying to draw a finite automation that has no limits on the length, but cannot have the substring of 10
I created a DFA that could satisfy this requirement, but am uncertain about the accept states having 01 because you can use the loop to create something like (i.e. 101010).
But I can't add additional transi... |
I'm learning about Turing machine program,i want to know how we write a Turing machine program about any given problem, like a string is accepted by Turing machine, program (for a Single Tape Turing Machine) that checks if a binary
number on the tape is an even number etc
|
Is it possible for there to exist two context-free grammars where the set of rules of the first is a proper subset of the set of rules of the second, yet the language generated by the second grammar is a proper subset of the language generated by the first?
|
Several years ago, I tried to get two identical pairs of DDR4 RAM to run together in my computer. I have since bought a set of four, but I've always wondered why the RAM didn't work. Its been long enough that I don't have images from the MemTest, but I keenly recall the errors the test was throwing constantly from the ... |
There is a sorted integer array $a_1 \dots a_n$ and an integer $1 \leq k \leq n$, we need to figure out the minimized total cost to group this integer array into $k$ groups. The cost per group is mean($a_i \dots a_j$) for a group from $i$ to $j$. Give an algorithm in $O(nk)$. Group here means partitioning and there's n... |
I have only begun studying this subject and have only completed the first few chapters of the Elements of the Theory of Computation.
I have seen the answers (on this site and elsewhere) saying that the set of all Turing machines is countably infinite. Intuitively, this makes sense to me, as I can imagine the equinumero... |
Just curioius, I wanted to know when $S$ ={set of divisors of N} and we're given $N$ a target product. Our goal is to decide if a combination in $S$ has product equal to N.
Does the problem remain NP-complete in this restriction? Assuming only positive integers?
|
According to this link binary variables - absolute values the formula of some binary variables like absolute value is :
y = | x1 - x2| for two variables x1, x2 with 0 ≤ xi ≤ U
Introduce binary variables d1, d2 to mean
d1 : 1 if x1 - x2 is the positive value
d2 : 1 if x2 - x1 is the positive value
MIP formulation
0 ≤ xi... |
In the Chomsky hierarchy, level 0 grammars include all languages that can be recognized by a Turing machine. There is no level -1 (which would represent the class of languages that cannot be recognized by a Turing machine, but can be recognized by something more computationally powerful than a Turing machine). Turing m... |
Consider a uniquely designed museum where rooms are arranged in a tree structure.
Each room can have up to two child rooms connected by a path. The task is to develop
an algorithm to place a minimum number of security guards so that the entire museum
is guarded. A guard placed in a room can guard that room, its parent ... |
I am currently writing a tool that will be used in an industrial process to place components with physical requirements. It boils down to the following:
I have a set of points (typically, a few thousands);
I need to place these points on a (2D) plane;
for each pair A, B of points, I have a constraint that is either
t... |
In cuckoo hashing, an insertion failure occurs when there is an infinite loop of displacements. This is detected by a “max iterations” count on the insert function.
When the insert fails, the table is rehashed using two new hash functions. These are selected from a given hash family.
My question - how are these hash fu... |
There is a theorem stating that, given a random algorithm with a binary output that has a success probability $\geq 2/3$, you can always create the another algorithm that solves the same problem but with a success probability $\geq 1-\delta$ by just repeating the original algorithm $\mathcal{O}(1/\log\delta)$ times and... |
I am looking at $L=\{a^nb^m |n\neq m \}$. I would like to prove that $L$ is not regular.
This can easily done by assuming it is regular and looking at $\overline L$, or by using other theorems.
Despite that, I am interested in proving its not regular by using only the pumping lemma.
Let $k$ be my pumping constant. I tr... |
The Simon's problem is that, given a function $f:\{0,1\}^n\to\{0,1\}^n$ such that, for all $x,y\{0,1\}^n$ t satisfies
$$
f(x)=f(y)\text{ iff }x=y\oplus s
$$
where $s\in \{0,1\}^n$, and the Simon's problem is to find the secret string $s$ by querying $f$ as few as possible. Or in other words whether the function $f$ is... |
The maximum cut problem is a combinatorial optimization problem that seeks to partition the vertices of a graph into two sets, $S$ and $T$, in a way that maximizes the number of edges that cross between the two sets. The problem is tractable for planar graphs. However, the vertices can be assigned to any of the two set... |
Suppose you're given a black box $A$, and you're told $A$ can invert a matrix (assuming the matrix is invertible) $M$ in $O(T_A)$. You're also given a black box $B$, and you're told $B$ can multiply two matrices $X$ and $Y$ in $O(T_B)$.
There are two problems as follow:
How is it possible to compute $X \times Y$ by ju... |
Let
$D(V, A)$ be a $k$-partite DAG;
$P = \{ p_k : 1 \leqslant k \leqslant |P| \}$ such that $p_k \cap p_l = \emptyset$, $\forall k,l : k \neq l$, and $\bigcup_{1 \leqslant k \leqslant |P|} p_k = V$ be the set of partitions;
$A = \{ (i, j) : \forall_{1 \leqslant k \leqslant |P| - 1} (i \in p_k \wedge j \in p_{k + 1}) \... |
Need a grammar that can create this language, I am having issues getting a language to work and was looking for help.
|
I'm currently working on an interesting problem in function approximation thta just came to mind and am seeking insights or methodologies that might aid in approaching it. The problem is as follows:
Given a continuous function say, $f(x) = \sin(x)$, I want to find a polynomial $P(x)$ of degree $n$, where each coeffic... |
Background:
I've a degree in computer engineering that I completed 5 years ago. I got really good grades at algorithms class but forgot everything that I studied. My notes were lost while migrating to a different place.
Now, I want to relearn it. I have very little memory of how I learnt it at that time.
Resources
How ... |
I do not even know where to start with this assignment. I need to prove the following directly, that is, without using any Theorems or Lemmas. I have the following definitions:
$$\begin{array}{rcl}
\eta &: & A \to A_\bot\\
\eta\ a & = & \left\lfloor a \right\rfloor\\
(\star) & : & A_\bot \times (A\to B_\bot) \to B_\bot... |
So I have been tasked to anonymize clinical data that..most of the time would be present in the form of tables.
I've looked into algorithms like generalization,redaction,K-anonymity, l-diversity,t-closeness. But I am not sure how to robustly implement them. I've also looked into Microsoft presidio.
Are there any better... |
While converting NFA to DFA the number of states in both should be same or different?
|
I want to understand how the algorithm of selection sort sorts the given array,
$$A[5]=\{5,9,11,10,2\}$$
Step -$1:-$
I compare A[0] with remaining elements of the array and since $A[4]<A[0]$ I swap them which leaves me with,
$$A=\{2,9,11,10,5\}$$
Step-$2:-$ Repeating the similar procedure for $A[1]$ gives
$$\{2,5,11,10... |
I have a dataset with 1055 samples and 168 features. I want to remove some features in order to train a model on my dataset. The model should output a binary field (either 0 or 1 that is known). Some features are fake, since some of them have been generated randomly and added to the dataset . I want to only keep the re... |
I'm trying to read the following article, and in the abstract they write:
Let $\xi$ be a non-constant real-valued random variable with finite support, and let $M_n(\xi)$ denote a $n\times n$ random matrix with entries that are independent copies of $\xi$. For $\xi$ which is not uniform on its support, we show that:
$Pr... |
I have asked it already on math.stackexchange.com and stackoverflow.com but they said it was off-topic and could not help me. They pointed me to cs.stackexchange.com so hopefully somebody here can help me or atleast point me in the right direction.
We have been using a bayesian average on a website of ours for a couple... |
Is there an algorithm that would fit in the following situation:
I have a sub image A of a larger image, and a set of sub images B that could (but not necessarily) share border with A. Now the algorighm should find likelyhood of A sharing a border with a sub image in B. There may be errors or small gaps between the sub... |
Consider vector<int> C
I aim to calculate $\displaystyle \sum_i i*C[i]$ using some stl library. In there any stl function there to do that?
|
I have a directed graph (DAG) containing many nodes, all with various attributes (node attributes not edge attributes). I have a single target (finish) node and a set of source (start) nodes. I want to find a path through this graph that minimizes the sum of all the attributes on said path, and return the top N minimiz... |
Consider the RWM online algorithm
as defined in this Wikipedia article;
this version is with multiplicative update.
Let us assume that we define our weights
as a fraction;
that is, $w_i^t = 1 / (M_i^t+c)$,
where $i$ is an expert,
$M_i^t$ is the number of mistakes
of expert $i$ until, and including, time $t$,
and $c$ is... |
I have a tree, $T$, with $n$ nodes. My goal is to assign a non-zero weight to each node such that the following condition is met:
Upon removing any arbitrary node, the total weight of nodes in each resulting connected component should be equal.
Consider the following tree as an example:
1 -- 2 -- -3 -- 4
|
... |
I'm currently studying the 3x3x3 rubik-cube-solving algorithms developed by Kociemba, Korf, and Thistlethwaite and I'm interested in understanding their computational complexities.
Could someone please explain or provide the Big O notation for the time complexity of these algorithms?
|
In my studies of discrete mathematics, I've learned that a tree graph is inherently bipartite. I'm interested in finding an algorithmic approach to determine its bipartition. It seems to me that Breadth-First Search (BFS) could be a reasonable method for this task.
However, I'm struggling with the formal proof of this ... |
Given any number $N$ find a positive integer $k$ such that: $N + 12 k$ is a square.
And the second case when we add an additional constraint that $k$ must be as small as possible.
|
If we have a finite (directed) graph G, and a set of walks P in G. And assume that there exists an n so that all walks of lengths greater than n have at least one p in P as subpath, how would we find n? Does anyone know a polynomial time algorithm in |G|?
For example if we have the graph
1 -> 2 -> 3 -> 4
and P = {(2,3)... |
This question is an extension of this one.
Let
$D(V, A)$ be a $k$-partite DAG;
$P = \{ p_k : 1 \leqslant k \leqslant |P| \}$ such that $p_k \cap p_l = \emptyset$, $\forall k,l : k \neq l$, and $\bigcup_{1 \leqslant k \leqslant |P|} p_k = V$ be the set of partitions;
$c_p \in \mathbb{R}^{+}$ be the profit of partition ... |
I've been reading the wikipedia article about probabilistic context-free grammars (PCFGs), and they state that
PCFGs have application in areas as diverse as natural language processing to the study the structure of RNA molecules and design of programming languages.
but I'm having a hard time finding examples of their... |
My textbook (Saurabh's Introduction to VLSI Design Flow) mentions while discussing formal verification that a representation of a Boolean function is said to be canonical if the following holds:
If a representation is canonical, then the two functionally equivalent functions are represented identically. Conversely, if... |
I need help with this question. If it’s possible to do this without limits, please show. Thanks.
Q: If f(n) is Ω(n) and g(n) is O(n), then prove or disprove the following statement: f(n) is O(n)
|
I am a high school student who is very interested in computer science and has been studying it since middle school. I've heard a lot of news about the rise in computer science majors in college and how that affects school acceptance rates. Should I be worried about this and how it'll affect my college application expe... |
i have seen some articles where they use the diagonalization argument to prove the existence of non-primitive recursive functions. But this should only work if we can create an infinite list of every possible primitive recursisve function in a computable way, like say for eg we should be able to find the output of nth ... |
A caterpillar is a subgraph which consists of a path with at most four leaves (legs) attached to each node (but a node can also have no leaves). This is not the same as finding the longest path, because we measure the number of vertices (including the legs), not the length. Find an algorithm with time complexity of O(n... |
For any set of strings A, define the set FirstHalves A = {x∣∃y such that len(y) = len(x) and xy in A }. For example, FirstHalves {01, 111, 1010, 001101, 1011} = {0, 10, 001}, ie the first halves of the even length strings.
Let B = {01, 011, 0111, 01111, 011111, ...}.
What is the set FirstHalves B? You can simply write... |
As the title says, the question is about finding the maximal bottleneck edge in path P.
Bottleneck of a path P in an undirected graph G = (V,E) is defined to be the weight of the edge with minimal weight on P. Given a graph G and s,t in V, find the path between s and t with the maximal bottleneck. In other words, find ... |
Given a $n \times n$ matrix $M$ of positive integers and a constant $d$. If $R,C \subset \{1,...,n\} $ let $$S_M(R,C) = \sum_{r \in R,c \in C }M_{i,j} $$
I want to find the sets $$R,C \subset \{1,...,n\}, |R|,|C| = d $$ such that $S_M(R,C)$ is as big as possible.
I suspect this to be a known problem. I am wondering if... |
Given $\{\rho_i,v_i\}_{i=1}^N$, the densities and volumes of $N$ items, and $K\in \mathbb{Z}_+$. Let $v_0=1$ be the initial volume, and the initial mass is zero. The values $\rho_i,v_i\in \mathbb{R}_+$. For $S\subseteq [N]$, the corresponding average density is
$$d(S):=\frac{\sum_{i\in S} \rho_i v_i}{v_0+\sum_{j\in S}v... |
Let $G=(V,E)$ be an unweighted directed acyclic graph with a set $V$ of vertices and a set $E$ of edges. The all-pairs shortest path problem can be solved efficiently using the Floyd-Warshall algorithm. The new objective is to find a subset of maximum cardinality $S \subseteq V$ such that for every pair of vertices $v$... |
I have two 64-bit numbers a and b which have a few properties: only 49 out of the 64 bits are used (15 bits are always 0), and the two number's binary representations are disjoint (a & b == 0). I am looking for a good way to hash the two numbers together into a deterministic 64-bit integer.
Tabular hashing with randoml... |
I have a system in which I need to be able to calculate the week number and day number from any Monday to the current date. Weeks can only be 1-4, then it starts over. So, if we are 5 weeks from the "Monday start date", then we're actually on Week #1 again. Days can only be 0-6. 1 = Monday, etc. Start date must always ... |
Consider a quadratic function over positive integers. For example say a simple function of the form: $f(n)=3n+4n^2$
Now given any positive integer $C$ find two integers such that: $f(i)-f(j) = C$
What is the complexity of such problems? I tried searching for a bit but didn't find an answer..
|
(22)10 - (65)10= (?)2
Perform this operation using 2's compliment method.Use 8bit representation of numbers
|
I'm a new professor and working at a computer science college. I'm going to be responsible for giving a one-hour lecture to motivate my students to study automata groups.
I'm very experienced as a teacher and I think that I'm a really good speaker, but no idea about how to make these topics friendly and attractive for ... |
Given $N$ a whole number and a set $S$ of divisors of N, where no repetition is allowed. Decide if there is a combination of divisors with a product equal to $N$.
Remove non-divisors from $S$.
Remove duplicates from S by using set() in python.
Treat $S$ as list of non-duplicates and sort from smallest to largest. This... |
I'm a new professor and working at a computer science college. I'm going to be responsible for giving a one-hour lecture to motivate my students to study automatic groups.
I'm very experienced as a teacher and I think that I'm a really good speaker, but no idea about how to make these topics friendly and attractive for... |
in $\epsilon$-NFA (NFAs involving $\epsilon$ transitions) when we have $\epsilon$ transitions, I understand it as where can we go if we don't read any symbol from the input tape, then I think every state $q$ from which we are considering transition must belong to $\delta(q,\epsilon)$ because if we don't read anything, ... |
I have read that Ethereum can theoretically support large documents (1 MB), but that such transactions would be very expensive and they risk not being validated.
Most blockchain document services I have found assign a hash to a document then put the hash on the blockchain, but I am wondering if any blockchain ledgers e... |
I have this language , le langage L={ a ^ s * b ^ t * c ^ m / where s >= t or s >= m }
I cant find a grammar for this language please help me
Grammar like S -> aS……
|
Prove\Disprove\Prove that equivalent to $NP=P$ or $NP\ne P$
given $L_1 \in P$ , $L_2 \in NP$ is $L_1 \cup L_2 \in P$?
Obviously $L_1 \cup L_2 \in NP$ because NP is closed under union and $P \subseteq NP$ so $L_1 \in NP$ as well.
I tried to assume in contradiction that $L_1 \cup L_2 \in P$ and build a $TM$ for $L_2$.
Le... |
Starting from a vertex of an unknown, finite, strongly connected directed graph, we want to 'get out' (reach the vertex of the labyrinth called 'end'). Each vertex has two exits (edge which goes from vertex in question to an other one), one exit is labeled 'a', the other exit is labeled 'b'.
We have limitless 'memor... |
See this answer first: Proving worst-case running time is in $\Omega(n^2)$
Understanding the linked answer for insertion sort leads to the following statement. Prove that the statement is either incorrect or correct.
Statement:
If you find $(y)$ for worst case running time of an algorithm using some possible worst inpu... |
Benchmarking typically consists of getting the current CPU time, executing test code a large number of times, and then subtracting the new CPU time from the previous one. However when you benchmark code multiple times, the results tend to vary either slightly to significantly each time. You will very likely not get the... |
For concreteness, here's the specific problem description: suppose we have a set $S$ of $n$ items $a_1, a_2, \ldots, a_n$ with weights $w_1, w_2, \ldots, w_n$ respectively. The goal is to select a subset of size $k$ such that the probability of selecting the subset $a_{i_1}, a_{i_2}, \ldots, a_{i_k}$ is exactly $\dfrac... |
Is there support in the foundation of mathematics for dimensioned quantities?
Those immersed in real-world software problems, continually confront the absence of dimensioned quantities in programming languages. Occasionally this results in a billion dollar disaster, such as the Mars Climate Orbiter. This absence appe... |
From what I have seen on YouTube such as https://youtu.be/Kzx88YBF7dY?si=5j9tzjMFGCn3aCXW,
We have:
Halt: program x input ---> yes halt/ no halt
and opposite : halt if Halt returns no halt, and, looping if Halt returns yes halt
so the input of opposite should also be : program x input right? not just a single program.
... |
So I recently learned about dual-port and multi-port RAM but I tried doing some research on modern RAM architectures and if they use it but I couldn't find anything on it.
|
I recently read about the “computer” built out of matchboxes designed by Donald Michie that could teach itself how to play tic tac toe. Here is the Wikipedia article about it:
https://en.m.wikipedia.org/wiki/Matchbox_Educable_Noughts_and_Crosses_Engine
I thought it looked interesting, so I decided to make a digital ver... |
In Ben-David & et al.'s Understanding Machine Learning, the authors wrote:
Let $\mathcal{H}_n$ be the class of axis aligned rectangles in $\mathbb{R}^n$ , namely,
$$
\mathcal{H}_n = \{h(a_1,\dots,a_n, b_1,\dots, b_n) :\forall i,a_i \le b_i\}
$$
where
$$
h(a_1,\dots,a_n, b_1,\dots, b_n)(x,y)=
\begin{cases}
1\text{ if }... |
In the C language, there's the 2 similar-in-form but distict-in-meaning constructs:
(type)value which is a casting, and (value), which is a grouping.
How do a $LR(1)$ parser deal with this? I can think of a compiler that breaks syntax and semantic boundary able to disambiguate it by providing information about the mean... |
I have read and understood various proofs, but have not been able to understand precisely why we require $S=\Omega(\log n)$.
|
From the internet:
A finite-state machine is formally defined as a 5-tuple (Q, I, Z, ∂, W) such that:
Q = finite set of states
I = finite set of input symbols
Z = finite set of output symbols
∂ = mapping of I x Q into Q called the state transition function, i.e. I x Q → Q
W = mapping W of I x Q onto Z, called the outp... |
I am writing a program in TI Code Composer Studio assembly-only empty project using the MSP-EXP430FR6989. The assembly-only empty project uses MSP430 Assembler Code Template for use with TI Code Composer Studio. Here is the project requirements:
Use the MSP430 seven-segment daughter board to display and multiply two 8-... |
Consider the scenario where we are given a collection of n integers. These integers are unordered and may include duplicates. Additionally, we have a set of m ranges, each defined by two integers representing the lower and upper boundaries of the interval. Similar to the integers, these intervals are unordered and dupl... |
Are there any well established algorithms for finding an object's location in 3D space when we know its approximate distance to at least 3 known locations?
Trilateration seems to be a well understood and popular topic and yet the only algorithms I've found come from fringe academic papers. I'm looking for a widely acce... |
I have this E-R diagram
Now im asked to add a entity named as "kiosk".At a kiosk up to 2 items of expedition of different category can be expedited.How do I add this in the E-R diagram?
The category is a attribute of a item of expedition (top left corner) so how do you reference to a attribute of another entity of t... |
In "Computational Complexity: A Modern Approach", it states that to prove that $NSPACE(s(n))\subseteq DTIME(2^{O(s(n)})$, we can do the following:
By enumerating over all possible configurations, we can construct the graph $G_{M,x}$ in $2^{O(s(n)}$ time and check whether $C_{start}$ is connected to $C_{accept}$ in $G_... |
I need to understand the motivations behind distributed computing, namely the fact to perform a computation by making physically separated computer, connected by communication links, work together.
I am in particular interested in a review explaining their interest in the context of being more resilient to errors (I kn... |
Let M be a non-deterministic Turing machine (NDTM) that accepts a language L if and only if:
for each $ x\in L $ M doesn't accept x for at most m branch(path) calculations.
for each $ x\notin L $ M doesn't reject x for at most m branch calculations.
let M be a Turing machine non deterministic, with one or two optio... |
I am trying to read about Alternating Turing Machines (ATM) that have both existential and universal quantifiers for all their internal states. Given that these models are conceptual, I tend to imagine that there is some form of reflection in terms of an advantage provided to the deterministic Turing Machine to provide... |
According to this paper [1], higher-order Datalog is more expressive:
... we demonstrate that on ordered databases, for all k ≥ 2,
k-order Datalog captures (k − 1)-EXPTIME. This result suggests that higher-order extensions of Datalog possess superior expressive power ...
But how is it possible for higher-order Datalo... |
Let’s say there are n fixed words permitted in some game of Scrabble, on an m x m squares board.
We are assuming an idealized scenario where anyone can write any word on the board. Assume both players have an unlimited number of every word. Or, assume there is only one player, playing every round.
Assume all the allowe... |
I know that quasi polynomial algorithm is neither polynomial nor exponential. But I want to know if we find such algorithm for NP complete problem, will it be of any use? Or is there such algorithm exists already?
I want to know why it becomes impossible to solve NP complete problems on regular machine. Is it because i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.