Theoretical Computer Science

Nice Question

 Nice Question
Question score of 10 or more. This badge can be awarded multiple times.

earned this badge 4 times.
Are quasi-polynomial sized circuits for 3-SAT trivial?
Awarded Oct 26, 2014 at 6:16
Has there been any research on $k$-SAT above the satisfiability threshold?
Awarded Apr 9, 2014 at 15:11
How close can we get to linear multiply, add, and compare (on integers)?
Awarded Nov 14, 2012 at 20:18
Where do I turn for help with research/publishing?
Awarded Nov 12, 2012 at 23:32

Others with this badge

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.