Skip to main content
Theoretical Computer Science

Nice Answer

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

earned this badge 18 times.
Suppose $\mathbf{P} = \mathbf{BQP}$. Then what is randomness? Would it even exist at all?
Awarded Dec 4, 2019 at 19:30
The cozy neighborhoods of "P" and of "NP-hard"
Awarded Jun 7, 2016 at 5:10
Applications of representation theory of the symmetric group
Awarded Sep 9, 2015 at 20:01
Reasons for which a graph may be not $k$ colorable?
Awarded Jan 23, 2015 at 10:42
Applications of TCS to classical mathematics?
Awarded Jun 3, 2014 at 9:59
Conjectures implying Four Color Theorem
Awarded Feb 28, 2014 at 4:08
Reasons for which a graph may be not $k$ colorable?
Awarded Oct 4, 2013 at 14:50
Overarching reasons why problems are in P or BPP
Awarded Oct 4, 2013 at 1:49
Intractability of NP-complete problems as a principle of physics?
Awarded Jul 24, 2013 at 3:40
Should we consider $\mathsf{P} \neq \mathsf{NP}$ a law of nature?
Awarded Jan 31, 2013 at 10:42
Complex analysis in theoretical computer science
Awarded Jan 15, 2013 at 0:03
Examples of the price of abstraction?
Awarded Dec 13, 2012 at 7:02
Major unsolved problems in theoretical computer science?
Awarded Aug 16, 2011 at 5:40
Coloring Planar Graphs
Awarded Jan 2, 2011 at 0:23
Extension to the Stable Marriage Problem ?
Awarded Nov 5, 2010 at 0:43
What would it mean to disprove Church-Turing thesis?
Awarded Nov 3, 2010 at 6:42
Applications of TCS to classical mathematics?
Awarded Oct 29, 2010 at 4:18
Quantum computing project ideas
Awarded Oct 27, 2010 at 20:55

Others with this badge