Top Questions

5 votes

1 answer

335 views

How hard is Hex from a symmetric position?

Kevin Wang's user avatar

Kevin Wang

Idan Attias's user avatar

54 votes

5 answers

15k views

Is finding the minimum regular expression an NP-complete problem?

Idan Attias

7 votes

0 answers

300 views

Reasons to believe $\mathsf{P} = \mathsf{NP} \cap \mathsf{coNP}$

D.R's user avatar

D.R

7 votes

1 answer

153 views

Complexity of computing the simplicial width of a graph

10.9k

Idan Attias's user avatar

0 votes

1 answer

101 views

Can equivalence queries be replaced by random examples in PAC learning?

Idan Attias

answered Nov 13 at 23:03

1 vote

1 answer

79 views

pullbacks and cartesian arrows

ct.category-theory

Nash's user avatar

Nash

answered Nov 13 at 15:51

6 votes

1 answer

571 views

Semantic proof of lambda calculus consistency?

Glorfindel's user avatar

Glorfindel

modified Nov 12 at 10:26

2 votes

1 answer

279 views

How to Classify Memory Access Pattern by LLVM or Other Tools?

Hermann Gruber's user avatar

Community Bot

modified Nov 11 at 15:02

2 votes

0 answers

131 views

Does resolution admit polynomial-size proofs for sorting encoded as CNF?

Jogenara's user avatar

Jogenara

modified Nov 10 at 22:58

7 votes

2 answers

452 views

Minimal Number of Symbols in Context-Free Grammar for a Special One-Letter Language

Hermann Gruber

6,984

modified Nov 9 at 16:37

11 votes

1 answer

307 views

Is it formally meaningful to say an NP language is "complete under Levin reductions"?

20.6k

modified Nov 9 at 13:00

7 votes

1 answer

310 views

Complexity of CNF-SAT parameterized by the number of clauses

Gavin D. Howard's user avatar

10.9k

answered Nov 7 at 15:01

-2 votes

0 answers

106 views

If the Upper Bound of the Factoring Period is N, Is Shor's Algorithm Actually Exponential?

Gavin D. Howard

asked Nov 6 at 20:40

11 votes

3 answers

652 views

What's the "smallest" complexity class for which an $\omega \hspace{.02 in}(n)$ circuit lower bound is known?

20.6k

answered Nov 5 at 8:01

26 votes

5 answers

1k views

What's the "smallest" complexity class for which a superlinear circuit bound is known?

minh quý lê's user avatar

20.6k

answered Nov 5 at 7:57

5 votes

0 answers

209 views

Hidden constant in complexity of the AKS primality test

minh quý lê

modified Nov 4 at 15:12

1 vote

1 answer

141 views

Simplest example of a "natural" complete problem for a TFNP class

Huck Bennett's user avatar

Huck Bennett

5,285

answered Nov 4 at 4:33

6 votes

0 answers

199 views

Does $\mathsf{FP} \subseteq \mathsf{FNP}$ really hold?

Yixin Cao's user avatar

Yixin Cao

2,619

modified Nov 2 at 11:08

2 votes

1 answer

305 views

Where does a problem lie which is NP-hard but not QMA-hard?

Manish Kumar's user avatar

Manish Kumar

modified Nov 1 at 8:41

6 votes

0 answers

117 views

About hardness result for ILP with fixed number of variable

Jaron Niederer's user avatar

20.6k

modified Oct 31 at 7:24

4 votes

2 answers

277 views

What is the meaning of 'uniform' in Blum's paper "On the Size of Machines"

computability

Jaron Niederer

answered Oct 31 at 7:22

1 vote

0 answers

46 views

Budgeted maximum coverage with integer weights

polar_bear_cheese's user avatar

polar_bear_cheese

asked Oct 31 at 4:12

8 votes

1 answer

1k views

Comparing Shor's and Regev's Quantum Factoring algorithm

Manish Kumar's user avatar

Manish Kumar

modified Oct 31 at 3:28

65 votes

7 answers

5k views

Theoretical explanations for practical success of SAT solvers?

Giorgio Camerani's user avatar

Giorgio Camerani

7,062

modified Oct 30 at 15:16

6 votes

2 answers

260 views

Delegating all of the work to the prover in $\mathcal{MA}$ protocols

The Amplitwist's user avatar

The Amplitwist

modified Oct 30 at 13:40

1 vote

1 answer

120 views

Problem on a Directed Graph subcase of load time scheduling

Community Bot

modified Oct 30 at 0:07

7 votes

2 answers

536 views

Are there problems in $DTIME(n^k) - DTIME(n^{k-1})$ that are not hard for $DTIME(n^{k-1})$ under nearly linear time reductions?

Neal Young's user avatar

Neal Young

12.2k

modified Oct 29 at 20:24

2 votes

0 answers

49 views

Packing induced $P_3$s and their complements

Yixin Cao's user avatar

Yixin Cao

2,619

modified Oct 29 at 6:45

2 votes

1 answer

204 views

Integer multiplication with limited space

Timothy Chow's user avatar

Community Bot

modified Oct 29 at 3:03

2 votes

0 answers

83 views

Fast computation of volume of overlapping unit balls

Timothy Chow

7,826

asked Oct 28 at 14:40

11 votes

1 answer

350 views

Extending Fliess theorem to weighted automata over commutative semirings

Denis's user avatar

Denis

9,339

answered Oct 27 at 14:05

4 votes

1 answer

165 views

How to combine graded modality with simply typed lambda calculus?

taquetgauche's user avatar

taquetgauche

answered Oct 26 at 10:46

15 votes

3 answers

2k views

Space alternating hierarchy

David Carral's user avatar

20.6k

modified Oct 26 at 10:42

2 votes

0 answers

61 views

Cache-Oblivious large integer multiplication

qwerty1793's user avatar

qwerty1793

asked Oct 25 at 13:22

1 vote

1 answer

330 views

3 Matroid Intersection, a Special Case

Chao Xu's user avatar

Chao Xu

4,579

modified Oct 24 at 11:21

0 votes

0 answers

75 views

Complexity of Acceptance within an Arithmetical Time Limit

David Carral

modified Oct 24 at 8:20

1 vote

1 answer

130 views

Matching with optional and required vertices

10.9k

answered Oct 23 at 13:37

4 votes

0 answers

51 views

Min-difference boolean convolution-like operation

alsips-cl's user avatar

alsips-cl

asked Oct 23 at 13:29

1 vote

2 answers

206 views

Show that the first agent weakly prefers their own bundle to anybody else's

Community Bot

modified Oct 22 at 20:05

9 votes

1 answer

1k views

Is there a hidden link between the existence of uncountable sets and the undecidability of the halting problem?

halting-problem

10.9k

modified Oct 22 at 6:43

3 votes

1 answer

236 views

Faster dimensionality reduction

D.W.'s user avatar

D.W.

12.8k

modified Oct 21 at 19:34

12 votes

2 answers

415 views

Determining what can be achieved by a permutation of elements of a noncommutative group