Badge
| Nice Question | Question score of 10 or more. This badge can be awarded multiple times. |
Kaveh earned this badge 28 times |
apr 5 at 20:41
Constructively efficient algorithms without efficient correctness and efficiency proof
jan 7 at 15:34
Consequences of $\mathsf{NP}$ containing $\mathsf{BPP}$
oct 9 at 20:01
Can we count in depth $\frac{\lg n}{\lg \lg n}$?
oct 4 at 15:32
Handbook of advanced data structures
aug 24 at 20:37
Descriptive complexity characterization of TimeSpace classes
apr 30 '12 at 9:08
Looking for a nice problem inside SC but not in the first two levels
jan 13 '12 at 20:10
Which algorithms are used most often in practice?
nov 11 '11 at 9:16
Monotone arithmetic circuits
oct 28 '11 at 7:58
Does $\mathsf{P/poly}$ have subexponential-size bounded-depth circuits?
oct 21 '11 at 13:36
Conditional density of primes
apr 29 '11 at 14:56
Models of random graphs, for real computer networks
mar 3 '11 at 16:30
Curry-Howard and programs from non-constructive proofs
dec 3 '10 at 18:01
What are the classic papers from the recursion theoretic area of complexity theory?
nov 13 '10 at 16:31
Advice on good research practices
nov 4 '10 at 14:33
Survey on algorithms/complexity of linear algebra
oct 21 '10 at 16:20
Random monotone function
oct 12 '10 at 7:30
What are the reasons that researchers in computational geometry prefer the BSS/real-RAM model?
oct 6 '10 at 21:35
Is $AC^0/poly \cap NP$ contained in $P$?
sep 26 '10 at 15:15
Is there a candidate for a natural problem in $P/poly - P$?
aug 23 '10 at 9:57
The importance of Integrality Gap
aug 20 '10 at 23:50
Which results in complexity theory make essential use of uniformity?
aug 17 '10 at 18:29
What evidence do we have for (and against) Unique Games Conjecture?
