43

Answers
votes newest views recent
6
“NP has linear circuits” --> something interesting? [soft, philosophical, open]
9
Is P=NP relevant to finding proofs of everyday mathematical propositions?
11
How is #P related to other complexity classes?
3
Finding a subgraph with slightly large size in planar graphs
3
nonasymptotic complexity results
9
P/poly algorithm for polynomial identity testing
3
Use of randomness in constant parallel time
6
Collapsing of exptime and alternation bounded turing machine
7
Does EXP $\in$ P/poly imply NP=RP?
7
When would you read a paper claiming to have settled a long open problem like $P$ vs. $NP$?
11
A language complete for NP intersection co-NP
14
Correct to characterise NP set as P-time image of P set?
6
What are the most important results (and papers) in complexity theory that every one should know?
13
Complete problems for randomized complexity classes
12
Fast Matrix Multiplication
7
What is the relationship between “translation” and time complexity?
7
Non-uniform constant-depth circuits
13
EXPTime algorithms
36
Can a mathematical definition be wrong?
5
Provably intractable problems
3
A decision problem in graph coloring
5
Characterizing visual proofs
4
Proofs of Lower Bounds for Ramsey Numbers?
4
“Industry”/Government jobs for mathematicians
8
Non-existence of algorithm converting NP algorithm to P algorithm?
6
duplicate detection problem
3
Is every input gate of a Boolean Circuit (to decide a language) on a path to the output gate?
12
What is the best algorithm to find the smallest nonzero Eigenvalue of a symmetric matrix?
7
How hard is it to solve SAT if the promise is that it has an odd number of solutions?
5
Finding all roots of a polynomial
1 2 next