Theoretical Computer Science

Help Center > Badges > Enlightened

 Enlightened
First to answer and accepted with score of 10 or more. This badge can be awarded multiple times.

earned this badge 8 times.
Inapproximability of set cover: can I assume m=poly(n)?
Awarded Oct 3 '11 at 19:05
Effect of serial repetition on soundness of a PCP, and what is special with 1/2?
Awarded Sep 27 '11 at 9:29
Polynomial-time algorithms with huge exponent/constant
Awarded Jul 7 '11 at 4:42
UGC hardness of the predicate $NAE(x_1, …, x_\ell)$ for $x_i \in GF(k)$?
Awarded Feb 2 '11 at 1:05
Explicit balanced matrix
Awarded Dec 19 '10 at 12:31
NP-hard problems on expander graphs?
Awarded Nov 22 '10 at 2:14
If P=NP, could we obtain proofs of Goldbach's Conjecture etc.?
Awarded Nov 10 '10 at 14:38
Reducing P vs. NP to SAT
Awarded Oct 18 '10 at 2:45

Others with this badge