Theoretical Computer Science

Nice Question

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

earned this badge 35 times.
Relationship between two graph optimization problems
Awarded Dec 17 '19 at 20:30
Complexity of unique coloring of graphs
Awarded Oct 14 '19 at 5:10
“Relatives” of the shortest path problem
Awarded Sep 30 '19 at 13:05
Natural candidates for NP-E and E-NP
Awarded Apr 21 '19 at 10:40
What would be the consequences of PH=PSPACE?
Awarded Aug 1 '18 at 7:10
What is the complexity of this graph problem?
Awarded Feb 20 '18 at 19:31
Is there an NP-complete language that contains precisely half of the n-bit instances?
Awarded Nov 26 '16 at 6:31
How common is phase transition in NP-complete problems?
Awarded Jan 14 '16 at 16:32
“Almost easy” NP-complete problems
Awarded Nov 16 '15 at 3:23
Which graph parameters are NOT concentrated on random graphs?
Awarded Nov 2 '15 at 21:25
For which problems in P is it easier to verify the result than to find it?
Awarded Nov 1 '15 at 6:32
What do dichotomy theorems feed on?
Awarded Oct 13 '15 at 19:15
Nontrivial problems solvable in constant time?
Awarded Oct 13 '15 at 1:39
Obituaries of dead conjectures
Awarded Oct 6 '15 at 0:49
Slowest many-one reduction?
Awarded Oct 5 '15 at 0:42
How much would a SAT oracle help speeding up polynomial time algorithms?
Awarded Sep 29 '15 at 8:06
Time complexity with irrational exponent?
Awarded Sep 27 '15 at 16:35
Randomized Polynomial Hierarchy?
Awarded Sep 2 '15 at 6:20
Can a hereditary graph class contain almost all, but not all, n-vertex graphs?
Awarded Aug 1 '15 at 17:12
Is P equal to the intersection of all superpolynomial time classes?
Awarded Sep 19 '14 at 2:11
Problems that are easy on unweighted graphs, but hard for weighted graphs
Awarded May 29 '14 at 15:16
Arguments for/against Kolmogorov's conjecture about the circuit complexity of P
Awarded May 12 '14 at 1:21
The unreasonable power of non-uniformity
Awarded Apr 30 '14 at 18:45
Examples where the uniqueness of the solution makes it easier to find
Awarded Apr 13 '14 at 2:50
NP-complete graph property that is hereditary, but not additive?
Awarded Mar 2 '14 at 20:34
Natural candidate against the Isomorphism Conjecture?
Awarded Feb 28 '14 at 13:07
Complexity class separations without hierarchy theorems
Awarded Feb 25 '14 at 13:15
What is the complexity of this path problem?
Awarded Feb 17 '14 at 17:10
Optimization problems with good characterization, but no polynomial-time algorithm
Awarded Feb 15 '14 at 5:03
Hard-looking algorithmic problems made easy by theorems
Awarded Feb 14 '14 at 1:26
Why are so few natural candidates for NP-intermediate status?
Awarded Feb 8 '14 at 4:43
Hardest known natural problem in P?
Awarded Jan 18 '14 at 3:46
Does NP-completeness/hardness have to be constructive?
Awarded Feb 5 '13 at 16:59
Why does randomness have stronger effect on reductions than on algorithms?
Awarded Dec 24 '12 at 20:16
Hardness of approximation without the PCP theorem
Awarded Dec 2 '12 at 13:54

Others with this badge