instruction stringlengths 35 11.4k |
|---|
The proof of theorem 27 in http://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/IKW02/IKW02.pdf suggests
'If $NEXP = MA$, then $NEXP ⊂ P/poly$".
However looking at it seems it is close to stronger 'If $NEXP = EXP$, then $NEXP ⊂ P/poly$".
Can $NEXP\not ⊂ P/poly\implies NEXP\not = EXP$ be plausible?
|
Suppose that I want to get the size of the biggest palindrome in a string s, and I am restricted to do it using suffix trees what is the best complexity I will get and why? I checked other answers but I find them highly confused.
EDIT:
I tried create a suffix tree with the string and the inverse of the string and use a... |
In automata theory, we all read automata as finite automata, from the very beginning. What I want to know is, why are automata finite? To be clear, what is it in an automaton that is finite - the alphabet, language, strings made with regular expressions, or what? And are there (in theory) any non-finite automata?
|
I've already done some research on this topic, but it still isn't quite clear to me.
According to this post patricia trees are radix trees with $r = 2$. Every patricia tree I've seen so far is used to store alphanumeric symbols. Assuming that there are used 8 bits to represent one symbol, $r$ is the number of bits comp... |
I am not very into computer science theory but i feel like people are defining nondeterministic polynomial time as if it is another name of exponential time. I would be happy if you clarify it. thank you
|
The problem says:
Given an undirected simple graph G such that each node has at most d + 1 neighbors, color each node with one of d + 1 colors so that for each edge the two nodes have different colors.
Hint : don't think too hard. just color the nodes. what loop invariant do you need?
I was trying to solve this.. but q... |
Assuming that ATM is decidable, how to build a TM S that uses a TM R that takes as input and decides if M accepts w, to decide HaltTM, which we already know is undecidable, hence ATM isn't decidable. So how exactly do we go about this?
|
given an unweighted graph, does the graph diameter equal to the maximum DFS tree depth?
and the same about BFS?
regarding both directed and undirected graphs.
thanks :)
|
I'm working on the following exercise:
Consider a point set $S = \{ p_1, p_2, ..., p_n \}$ in the plane in general position (i.e., no three points of $S$ are collinear). The points of $S$ have pairwise different $y$-coordinates and are sorted in increasing order of them, i.e., $y(p_i) < y(p_j) $ if and only if $i < j$... |
I've been trying to solve this problem for two days. This problem is from Vazirani's book Approximation Algorithms (pg 23).
Given an undirected graph $G = (V,E)$ with nonnegative edge costs, and an integer $k$, find a partition of $V$ into sets $S_1,\dots, S_k$ so that the total cost of edges running between these se... |
If there is a proof that an NP-Hard problem which is not NP-Complete can be solved in P time, it does say that the verification time is polynomial too.
Why doesn't it then mean that all NP-Hard are NP (i.e. NPC)?
But, if there is something with exponential verification i.e. outside NP and since it can be reduced to an... |
Let $L\subseteq \Sigma^*$ a Language
$R_L$ is the Myhill-Nerode-Relation of $L$
$\equiv_L$ is the Syntactic Congruence of $L$
$R_L$ and $\equiv_L$ are equivalence relations and are defined as follows :
$x\:R_L\:y \:\Leftrightarrow \: [\forall w\in\Sigma^* : xw\in L\Leftrightarrow yw\in L] $
$u\:\equiv_L\:v \:\Leftrigh... |
I'm trying to prove that $n\log n$ is space constructible. I've already managed to prove that $\log n$ is space constructible, but I cannot figure out how to prove the same about $n$. I assume, that if both $n$ and $\log n$ are space constructible, $n\log n$ will be space constructible as well.
I'm using Sipser's defin... |
Goal: Find a simple path in G, that visits the maximum number of vertices in Z and prove it is NP-complete.
G = (V , E)
Z is a subset of V
How would I go about doing this?
|
If I have a scheduling problem, is it possible that Hall's theorem can be applied? I was thinking that the graph representation of the scheduling problem can be the preferences of the people / workers getting scheduled. Is there any such result or counter-claim?
|
I have to find computational complexity of an expression for Euclidean distance
d(x,y)= {(x1-x2)^2 + (y1-y2)^2}^1/2
But I have certain confusion because of which I am unable to proceed. Firstly there are two variables. Secondly since there is a root ,what will be its effect? If there were no roots, I can understand... |
I have a question
Given a 16-bit register A holding a number in 2’s complement form, use a
single gate (e.g., AND, OR,
XOR, NAND, NOR, NOT) with an arbitrary number of inputs to implement a
circuit that produces an
output 1 if the number is divisible by 16, and an output 0 otherwise. The
bits are labelle... |
I thought of some mixed algorithm: binary + interpolation search. While first has $O(\log n)$ runtime in both worst and average cases, second has $O(n)$ worst case runtime and $O(\log \log n)$ average case.
However, I think, if such algorithms can exist, there are more than one of them.
Anyway, what I want to know if t... |
Let $S_{n}$ be an input set whose elements are length $n$, namely $S_{n} = \Sigma^{n}$. For every probabilistic polynomial-time algorithm $A$ and any $u \in \Sigma^{*}$, there exists a function $f^{A}$ such that $f^A(u) = \mathrm{Pr}[A(u) = 1]$. And let $f^{A}_{n} = \left.f^{A}\right\vert_{S_{n}}$ be a function from $S... |
General problem
Given a space $S$ which is $N$-dimensional, bounded, and quantized
Given a set $P$ of unique points
Find the set of collinear subsets of $P$, each containing at least 3 points
One point can exist in multiple subsets
Specific problem
I am creating a 4D, 5 by 5 by 5 by 5 tic tac toe game. Each dimension... |
Let $G$ be multipartite directed weighted graph with $k$ independent sets (we will call
them "layers"). We select exactly one node from each layer and form the induced subgraph $H_k$. That is, $H_k$ has exactly $k$ nodes (one from each layer) and contains all edges from $G$ that have both endpoints in $H_k$.
Our goal ... |
I am working on the problem of finding cycles in an undirected graph.
I made up my solution by first detecting if any cycles are present with a DFS algorithms and detecting any backtracking, and second, recursively explore all the found backtracked edges until I find the starting vertex.
The problem I have is that this... |
I'm reading right now Computers and Intractability by Garey and Johnson. I've found the definition of PTIME complexity class a little strange. This is how it looks:
Let $\Sigma = \{ 0,1\}$. By $\Sigma^{*}$ we denote the set of all finite strings created from symbols from $\Sigma$. If a computation on a Deterministic Tu... |
In << Data Structure and Algorithm Analysis >>, turnpike reconstruction problem is given for demo of backtracking.
Suppose we are given n points, p1 , p2 , . . . , pn , located on the X -axis. Xi is the x coordinate of pi . Let us further assume that X1 = 0 and the points are given from left to right. These n points d... |
$k = \Theta(n)$
The arrays consist only natural numbers $1$ to $n$
The sum of the length of all arrays = $\Theta(n)$
It should return the $k$ original arrays, each sorted on its own.
The running time should be at worst $\Theta(n)$.
How is it even possible? There's something I must be missing because I have no idea how ... |
Given positive numbers $x_1,x_2,\ldots,x_n$, a positive integer $k$, and a positive real number $D$, determine whether we can divide the numbers (according to the ordering) into $k$ parts so that each part has sum at least $D$.
A simple greedy algorithm works here: Find the least $i_1$ such that $x_1+x_2+\ldots+x_{i_... |
I read following here:
Unambiguous grammars do not always generate a DCFL.
Example:
For example, the language of even-length palindromes on the alphabet of 0 and 1 has the unambiguous context-free grammar S → 0S0 | 1S1 | ε. An arbitrary string of this language cannot be parsed without reading all its letters first, ... |
Suppose I have a sequence of elements $a_1,\ldots,a_n$ in a group and I want to compute, for varying $1\leq i\leq j\leq n$, the product $b_{i,j}:=\Pi_{i\leq k\leq j}a_k$. Then I can do a precomputation of all $b_{1,j}$ and later determine each needed $b_{i,j}$ as $(b_{1,i-1})^{-1}b_{1,j}$.
The cost is $O(n)$ group oper... |
how would you prove if this language is regular/irregular?
question given:
Decide for each of the following languages whether it is regular. If so, design a DFA/NFA for recognizing it, and if not, give a formal proof(based on the Pumping Lemma).
i) {a^i b^j c^k|i ≥ 0, j ≥ 0, k ≥ 0 are three integers};
I have construc... |
Is the following a familiar problem ? Given a graph $G = (V, E)$ and a capacity function $c:V \to \mathbb{N}$ find a spanning subgraph $H$ of $G$ such that $1 \leq deg_H(v) \leq c(v)$ for every vertex $v \in V$.
I would like to know if this is an NP-hard problem so any pointer to a similar problem (NP-hard or not) will... |
Given a graph $G = (V, E)$ and a natural number $k$, consider the problem of determining whether there is a way to color the vertices with two colors in such a way that at least $k$ edges are polychromatic.
Prove that this problem is NP-complete.
I thought about reducing it to the 3-colorability problem, but I can't ... |
This was a question that came up in a past exam paper in my computer science course, it states:
"There are two simple, un-optimised sorted data structures, each storing
n numbers. The first is a list; the second is an array. What is the
worst-case complexity of extracting the median number from each data
structure? Are... |
As merge sort and quicksort both have the same average time complexity of $O(n \log(n))$. In which scenarios would merge sort be preferred over quicksort when sorting data?
|
The theorem that "all languages are undecidable" offers the self-referential program as evidence in its proof, assuming that there exists a decider that decides L. The goal is to disproof this proof as it is not true that all languages are undecidable.
|
Suppose I have an algorithm $A$ that is known to halt before $f(n)$ steps for some function $f: \mathbb N \rightarrow \mathbb N$, where $n$ is the size of the input, and output is always either zero or one. Is it a decidable problem to determine whether $A$ always outputs zero?
|
I'm trying to understand how type safety is preserved for value types and for reference types, specifically in languages with managed memory (such as C#). I understand that reference types (i.e. classes) have data allocated onto a managed heap, with a reference to that data allocated on the stack. Is there metadata a... |
We're given two positive integers $t$ and $s$ of length $n$ in binary representation.
Suppose we divide the numbers into ${n \over k}$ blocks of size $k=\lg n$
using FFT algorithm.
Suppose that the multiplications that occur during recursive calls do not increase the length of the resulting numbers (not necessarily ... |
The maximum number of nodes in a binary tree of depth k is defined by $2^{(k+1)}-1$, but the same rule doesn't appear to work for heap trees of different degrees.
Let's say I have the following tree of degree 3
1
/ | \
2 3 4
Here the depth of the tree is 1. So according to the formula, it will be $3^{(1+1)}-1=8$... |
Are there any problems where there is no smallest time complexity, so there is a big-$\mathcal{O}$ but no big-$\Theta$?
More formally, I am looking for any problem $p$ where
for any algorithm that solves $p$ in time $f(n)$
there provably exists another algorithm that solves $p$ in time $g(n)$
where $g(n) = o(f(n))$.
... |
I have a floating point number x from [1, 500] that generates a binary y of 1 at some probability p. And I'm trying to find the x that has highest p. I'm assuming there's only one maximum.
I know we can do this with simulated annealing but I don't think I should hard code temperature because I need to use the same algo... |
The book I am learning about compilers from states that $M \to \alpha N \beta$
will generate a constraint that $\mathrm{FOLLOW}(M)$ is contained in $\mathrm{FOLLOW}(N)$ when $\beta$ is nullable.
This is a bit confusing because there can be other productions such as $M\to \gamma K \theta $. Logically, then, the set of ... |
Are there any NP-hard problems that are considered kind of the standard for reductions? There's so many but it feels like some come up more often than others (for example Vertex Cover, Independent Set, 3-SAT, etc.). I'm sure people just pick whatever is most convenient, but where's the boundary between "more useful" an... |
Suppose a deterministic Turing machine T decides language L and L is in NP. Then must it be provable in ZF that T decides L?
|
For any simple, connected, undirected graph $G(V,E,w)$ with each carrying distinct positive edge weights, is it true that MST will contain all the edges which do not lie in any cycle of $G$?
I think MST can take any edge of irrespective of the fact whether it is an edge of cycle (like I simply use Kruskal's), Also I am... |
Given a matrix $A \in \{0,1\}^{n \times n}$, use network flows to describe an algorithm that finds the minimal set $I$ of rows and columns such that any non-zero entry is in one of the rows or columns in $I$.
What I have tried
Create an intermediate column (between $s$ and $t$) for every column and row.
For every c... |
As the title suggests, I want to take a look at resources (books, lectures or papers) that are available (free or paid) on computation over reals. Thanks in advance!
|
It has been shown of course that the halting problem is undecidable. That is, we cannot formulate a Turing machine that will decide for any arbitrary turing machine whether it will halt or not.
However, I'm wondering, if we want to decide for the set of Turing machines $T$, whether a turing machine $t$ halts, and we s... |
I always tend to think of information as follows: If we have an information set $I$, and it is possible to derive from $I$ another information set $X$, then $I$ really contained $X$ all along, and we haven't actually discovered "new information". We've merely found out something new about the information we already had... |
Can someone please tell me the difference between Non re and CoRE languages with an example?
|
Let's assume we're talking about real functions purely for clarity purposes, but my question is more general.
We say that a function $f$ is computable, if for a given $x$, a turing machine can output $y$ such that $f(x)=y$.
However, I'm wondering whether there is some concept of "computability for the expresssion of a ... |
This is a very vague question, so I don't know if people will understand it (I'm not even sure I understand the question myself), but here goes. Also, I'm not sure if this is really the right forum to ask, but I thought that it relates to computer science because of the connection to function calls (see comment at bott... |
I have recently studied about interrupts and context switch i have read that the hardware interrupts cause the interrupt service subroutine to execute for this i read mixed articles saying that there no need for a context switch to kernel mode and some say we need a context switch to kernel mode from user mode do we n... |
I have been working for some time in several kinds of image recognition. They work well. One example is , character or shape recognition. I have implemented this in an embedded processor and I can recognize shapes and letters with this.
Now I am working on implementing this with a Hololens. Using my algorithms I have ... |
I came across following fact in Automata book by Hopcroft, Ullman:
Theorem 1: For every PDA accepting by empty stack (PDAeS), there is an equivalent one state PDA accepting by empty stack.
I was wondering how this applies to:
PDA accepting by final state (PDAfS)
Deterministic PDA accepting by empty stack (DPDAeS)
De... |
I have two endpoints, $a$ and $b$, that can communicate through a channel. $a$ is storing a set of fixed-length strings $A = \{a_1, \ldots, a_{N_A}\}$, and $b$ is storing another set of fixed-length strings $B = \{b_1, \ldots, b_{N_B}\}$, with in general $A \cap B \neq \emptyset$.
Now, I would like to run a procedure t... |
I'm trying to formulate a greedy algorithm for the Max k-cut problem:
Let's have an not oriented graph $G(V,E)$, each edge $e \in E$ has its weight $w_e$. The goal of the algorithm is to divide all vertices $v\in V$ to $k$ disjunct sets $V_1,\dots,V_k$ and maximize the weight of the edges that are connecting these sets... |
We are given a graph $G=(V,E)$ and we want an algorithm to find a set of vertices $U$ to maximize the following quantity : $\frac{|E(U)|}{|U|}$ where $E(U)$ denotes the number of edges in the subgraph made with vertex set $U$.
|
We know there is $B$ with $P^B \neq NP^B$, and we know there is $C$ with $coNP^C=NP^C$, what happens if we want to mix?
|
Are these languages in D, SD/D, or not in SD?
$$L_1 = \{\langle M \rangle\mid L(M)\cap (ab)^*\text{ is infinite}\}$$
I kind of understand decidability and undecidability problems, but the "$\cap(ab)^*$" here threw me off a little. but I'm thinking that maybe I should deal with this as if it's just $L(M)$ basically sinc... |
Given a directed graph such that at least an Eulerian path exists, how to determine efficiently if there is exactly one Eulerian path?
Of course if there is an Eulerian circuit then there is more than one Eulerian path, so we will assume that no Eulerian circuit exists.
In other words, just to fix some notation, we as... |
In general, context-free algorithm are not closed under intersection but the intersection between a regular language and a CF language is known to be context-free.
My question is: does exist an algorithm to compute intersection in these special cases?
Thanks.
|
I'm not sure how lower bounds affect the question to the P=NP problem.
I.e. :
Let a SAT instance with a size of n be transformed into an instance of a problem X with a size of n3.
If you find a lower bound of the SAT problem which is
$$\Omega(c^n) \ \ \ \ c > 1 $$
What would be the consequence to the problem P=NP?
We ... |
Given these two arrays:
[5, 3, 4, 1, 2]
[1, 3, 2, 4, 5]
Find the maximum subsequence in both arrays that the index of the elements are in a crescent order:
Example: [3, 4] it's an answer because the indexes are in a crescent way in both arrays. (same as [1, 2]). Therefore, the subsequence the answer [3, 4, 1] is wron... |
I was looking at Turing machines and Turing completeness and I was wondering whether it is possible to prove that there is a problem which cannot be solved by a Turing complete computer or whether it is possible to prove the opposite.
|
Does NP ⊆ Co-NP imply NP = Co-NP?
And also, does Co-NP ⊆ NP imply NP = Co-NP?
And does either statement imply P = NP?
Thank you very much in advance.
|
If we know the number of keys that we are going to get ,how do we calculate the size of the array we will need to store our separate chains in the hashtable?
All that using the mod hashfunction
|
I am trying to understand Time Hierarchy. I have an example that is solvable using the rules of Time Hierarchy. I would like an explanation on how to solve so that I may understand better how to use Time Hierarchy.
I need to show that the following are either equal, on inclusive of one another...
TIME($2^{n^2}$) and TI... |
I have started pumping lemma for context-free grammar by reading Sipser's book and there are two questions right at the end end of the topic which I don't understand how to solve or where to start from?
I have to show that the following languages are not context-free
L = { w | w = 0a 1 b 2 ab where a, b are >= 1... |
I am trying to prove what the maximum number of edges that can be added to the petersen graph is without changing the crossing number of 2.
|
I am trying to prove that the crossing number of complete graph with 7 vertices is greater than or equal to 7. I know that edges (m)=21 if it is complete, and if the graph were planer 2n = degree of faces, which I think is a minimum of 3 per face. So 2m gte 3f. Based on Euler's formula 3n-3m+3f gte 6 (scaled by 3) then... |
You are given a tree decomposition of a large graph with not so small bounded tree-width.
Suppose now you need to solve a dynamic programming problem inside a subgraph and does not have time to do another costly tree decomposition.
How do I find the tree decomposition of a subgraph given the decomposition of its "fathe... |
I have a difficult time understanding hashed page tables used in virtual memory management. Here is picture of the slide that I am referring to:
I understand that p is hashed and then the hash is checked in the page table for a match. What is elements referring to here? Is it the page table entry? What does chain mea... |
So, if there is something that is turing computable, I know it is in NP (is that right?).
If M is computable, does it mean M is in NP?
M computable IFF in NP (is that true)?
And does all computable machines exist under NPSPACE?
|
Consider for example the following recursive program:
function fibonacci(int n) {
if (n < 2) {
return 1;
} else {
return fibonacci(n - 2) + fibonacci(n - 1);
}
}
The question is now, why recursive programs are problematic for branch predictors? I think that this is due to the fact that the ... |
Given two positive integers $c_1$ and $c_2$ such that $c_1 < c_2$, it's easy to prove that $n^{c_1}$ is $\mathcal{O}(n^{c_2})$ while $n^{c_2}$ is not $\mathcal{O}(n^{c_1})$. In general, for any functions $f(n)$ and $g(n)$ it is possible to determine which one (or both) is true, $f \in \mathcal{O}(g)$ or $g \in \mathcal... |
I understand what the halting problem describes, but I do not understand how the proof by contradiction associated with it proves that it is impossible to solve.
The proof by contradiction can be defined as having a function Halt() which could determine whether a program will halt. One could then call this function in ... |
$L = (0^i 1)^n$ where i=1,2,3,4...n and n>=0
For eg :- 00010001 doesn't belong to the language as n=2 but i=3 at the beginning.
001001001 belongs to L as n=3 and i=2 in all cases.
I know the above language is not regular for sure as value of 'i' depends on value of 'n' and it requires comparison. So DFA not possible.... |
It seems that Functor definitions in Haskell can be accepted if the type is correct.
This code compiles, but it doesn't satisfy the functor law:
data Bst a = NIL | Node a (Bst a) (Bst a) deriving (Eq, Ord, Show)
instance Functor Bst where
fmap _ NIL = NIL
fmap f (Node v left right) = Node (f v) (fmap f right) (fma... |
For given positive integer $n$ find the first number $x$ with exactly $n$ divisors. For simplicity of the problem we can assume that $x$ will always fit in integer size and $n \leq 1000$.
Example
If $n=4, x = 6, \text{ divisors of 6 are } \{1, 2, 3, 6\}\\n=6, x=12, \text{divisors of 12 are } \{1,2,3,4,6,12\}$
I was th... |
One of my final exam questions asked me to give a Turing-unrecognizable language over an unary alphabet, which I wasn't able to complete, but I ended using the Busy Beaver function (BB(k)) which is known to be something intractable or uncomputable so that I constructed the language as a set of strings 1^BB(k) for natu... |
I am trying to prove decidability of problem whether language described by Turing machine is regular. My idea is that I can simulate finite automaton with a subset of Turing machine instructions, namely ones that check for symbol and then move right. If the language is not regular, then simulated FA will eventually com... |
Given a CFG G in Chomsky Normal Form with n variables. Prove that
$|L(G)| = \infty \iff \exists w \in L(G)$ such that $2^n<|w|\le2^{n+1}$
Now, proving left to right I've encountered a problem.
I am trying to prove it by taking a word above the pumping length, and "pumping down" till I get a word of length in the c... |
This problem has been heavily studied, and at last may have a potential solution.
The concept I have come up with was made entirely on my own, but is close to some other theories that will be referenced.
The intended purpose for posting here is to have more experienced software developers review my theory. Should it pr... |
Prove or disprove: Complement of language
$L=\left\{baba^2ba^3b...ba^{n-1}ba^nb \, | \, n \geq 1\right\}$ is
context-free.
I'm not quite sure how this is done. I would first try to find out whether $L=\left\{baba^2ba^3b...ba^{n-1}ba^nb \, | \, n \geq 1\right\}$ itself is context-free.
The language creates words $... |
Consider the formal problem:
Given a context-free grammar $G$, is the language $L(G)$ empty?
Can we determine if the problem is recursively enumerable, recursive, in NP, or in P? Can the entire procedure be explained?
|
How to find, or prove impossible, apolynomial time verifier for $\overline { EQ_{CFG}}$?
$\overline { EQ_{CFG}}$ means all pairs G and H, which are CFGs such that L(G) is not equal to L(H)
|
After Omer Reingold's famous proof (from 2005?) that SL = L, the distinction between natural L complete problems and natural SL complete problems has been mostly dropped, so that it became difficult for me to find examples of natural L complete problems. (Here "difficult" means article behind paywall and google book wi... |
I know that some operations are definitely constant time, such as accessing an item in a list, however there are other operations that are assumed constant time sometimes, but non-constant other times, such as multiplication.
So if we were to deal with very, very large operations, which operations would be truly const... |
How would I design an NFA that accepts all strings don't end in a certain sequence over the alphabet {0,1}.
Designing a DFA that does the job is fairly straight forward, but I can't find out how to make my Automata Non-Deterministic.
|
I'm a beginner. I would like to know if the size of a variable (and generally speaking of a storage space) is:
Its capacity (the amount of data that can be put in it).
The amount of data it contains
|
I have a made up machine, which has the same definition as Turing machine, but the transition function and the step of computation of the machine. What would be the approach of the proof that the language accepted by this machine is (or is not) equal to L0 (recursively enumerable language)?
|
If we have two $NP$ complete problems $\Pi_1$ and $\Pi_2$ such that yes instances of $\Pi_1$ are no instances of $\Pi_2$ and vice versa then we know $NP=coNP$.
Is the converse true as well?
That is if $NP=coNP$ then can we find two $NP$ complete problems $\Pi_1$ and $\Pi_2$ such that yes instances of $\Pi_1$ are no ... |
Let $p$ be a number represented in binary of length $n$. We'll divide $p$ into $\frac{n}{k}$ parts, each of length $k$ (let each part be $p_i$, $0 \le i\le \frac{n}{k}$) where $k=\lg n$. Now we want to represent $p$ as a sum:
$$
\sum_{i=0}^{\frac{n}{k}} p_i\cdot 2^{ik} \qquad(*)
$$
I know that multiplying a number in b... |
Given a $\lambda$-term $t\in \Lambda$ and an integer $k$, we say that $t$ behave likes the identity when applied to $k$ if $tk\to_\beta^*k$ (where the integer is represented as a church numeral). We will write $BI(t,k)$ for this property.
Given a term $t$, we define $a(t)$ as the smallest natural number that allows to ... |
what I understand is that, the file dependency is organized as a graph. Make/scons check the timestamp of each file, when a source file's timestamp is newer than the output, it re-compile everything depend on this file.
What kind of algorithm does Make/scons use to travel the graph? what if there are circles?
I have be... |
Given a threshold $t$ and a list of numbers $N$. $\forall n \in N: n \leq t$
Now group the numbers so that the sum of the numbers $s$ is lower or equal $t$. Minimize the amount of groups.
Example: $N={20,19,18,17,14,12,9,5,4}$ and $t = 40$
Possible Grouping: ${(20,19),(18,17,4),(14,12,9,5)}$ (Greedy)
Is greedy a strat... |
Let $X$ be an algorithm whose correctness supposed to be proved. What is the best practice to write the corresponding theorem?
For example:
Theorem: Algorithm $X$ correctly computes its output.
|
We talked about the following theorem in class but I am still having problems to understand it:
For a NP-complete decision problem "Does a valid solution with a value $\leq K$ exist?" there is no approximation algorithm for the corresponding minimization problem with an approximation factor $\lt 1 + 1/K$.
Why is this n... |
I'm trying to optimize a set of patterns in an image, but unfortunately they only way I have of evaluating the images results in smaller versions of the pattern scoring much better than larger versions.
As a result, the optimization methods I've tried all just end up shrinking the pattern down until they run into alias... |
How can we show $P/poly^{P/poly}=P/poly$?
What tricks are generally used for self lowness of a class such as $BPP$, $SPP$ etc?
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.