Skip to main content

Explore our questions

5 votes
1 answer
389 views

What is the time complexity of fermionic Fourier transform?

6 votes
1 answer
285 views
+100

Complexity of the Partition problem in the Real RAM model

1 vote
1 answer
128 views

Is this special case of quadratic programming NP-hard?

2 votes
0 answers
51 views

Löwenheim-Skolem theorem in many-sorted first-order logic

7 votes
1 answer
357 views

Is the following problem PPA-complete?

1 vote
1 answer
411 views

Generalization bound for parameters rather than loss functions

5 votes
2 answers
691 views

Turing machine halts on any input but not provably total

6 votes
1 answer
256 views

How hard is it to know if a graph has a hamiltonian cycle where we allow for jumps between vertices 3 edges apart in addition to adjacent vertices?

1 vote
1 answer
321 views

Minimum Degree Spanning Tree Without Restricting Vertices Searched

49 votes
1 answer
2k views

Problem unsolvable in $2^{o(n)}$ on inputs with $n$ bits, assuming ETH?

8 votes
2 answers
138 views

Modern presentation of first-order unification under a mixed prefix?

4 votes
1 answer
97 views

Circuit complexity of the all-pairs shortest path problem or schedulability of simple temporal networks

5 votes
1 answer
128 views

A polynomially checkable proof system capturing symmetry-based assumptions in Ramsey CNF proofs

3 votes
2 answers
156 views

What are the theoretic (upper, lower) bounds on the sizes of the EXACT smallest grammars of $s,|s| = n$ over a finite alphabet $|\Sigma| = k$?

Browse more Questions