Skip to main content

Explore our questions

0 votes
0 answers
23 views

Is there a self-synchronizing binary coding like Fibonacci coding but ordered well when interepreted as std binary digits?

8 votes
1 answer
114 views

Computational complexity of the elementary theory of finite fields

1 vote
0 answers
19 views

On the power of QMA(2)

0 votes
1 answer
42 views

Are there NPO (NP Optimization) problems that would require more than polynomial time even on a non-deterministic machine?

0 votes
0 answers
56 views
+50

Is set cover with a fixed number of variables and an arbitrary number of constraints fixed parameter tractable?

-1 votes
0 answers
53 views

What are some polynomials whose dft can be computed in linear time using essentially fft?

1 vote
0 answers
45 views

Efficient algorithm to construct simple polygon from non-crossing orthogonal line segments

18 votes
2 answers
2k views

Gentle introduction to graph isomorphism for bounded valance graphs

5 votes
2 answers
631 views

How Much Computing Power would be Required to Fully Simulate a Cubic Meter?

1 vote
0 answers
13 views

improvements on maximum depth algorithm when assuming homogeneous constraints

14 votes
3 answers
1k views

P/Poly vs Uniform Complexity Classes

1 vote
0 answers
54 views

Complexity of FirstMatch (Prefix Elimination) Operator for regular expressions

1 vote
0 answers
46 views

Closed-form for exact number of iterations of binary search

1 vote
1 answer
93 views

The problem of approximating the diameter of a point set

Browse more Questions