Theoretical Computer Science Stack Exchange

5 votes

1 answer

389 views

What is the time complexity of fermionic Fourier transform?

CommunityBot

1

modified 55 mins ago

6 votes

1 answer

285 views

+100

Complexity of the Partition problem in the Real RAM model

Erel Segal-Halevi

2,244

modified 5 hours ago

1 vote

1 answer

128 views

Is this special case of quadratic programming NP-hard?

Erel Segal-Halevi

2,244

answered 12 hours ago

2 votes

0 answers

51 views

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

Nicola Gigante

2,194

modified yesterday

7 votes

1 answer

357 views

Is the following problem PPA-complete?

Emil Jeřábek

21.3k

answered May 27 at 7:07

1 vote

1 answer

411 views

Generalization bound for parameters rather than loss functions

CommunityBot

1

modified May 25 at 18:05

5 votes

2 answers

691 views

Turing machine halts on any input but not provably total

Noah Schweber

593

modified May 24 at 21:53

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?

AIDoctrine

1

answered May 23 at 19:21

1 vote

1 answer

321 views

Minimum Degree Spanning Tree Without Restricting Vertices Searched

CommunityBot

1

modified May 22 at 21:07

49 votes

1 answer

2k views

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

AIDoctrine

1

answered May 22 at 19:59

8 votes

2 answers

138 views

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

Philip Zucker

11

answered May 21 at 17:38

4 votes

1 answer

97 views

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

Nicola Gigante

2,194

modified May 20 at 13:37

5 votes

1 answer

128 views

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

Jogenara

347

answered May 19 at 10:47

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$?

Hermann Gruber

7,074

modified May 17 at 20:48

Stack Exchange Network

Explore our questions

What is the time complexity of fermionic Fourier transform?

Complexity of the Partition problem in the Real RAM model

Is this special case of quadratic programming NP-hard?

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

Is the following problem PPA-complete?

Generalization bound for parameters rather than loss functions

Turing machine halts on any input but not provably total

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?

Minimum Degree Spanning Tree Without Restricting Vertices Searched

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

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

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

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

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$?

Hot Network Questions