Skip to main content
Theoretical Computer Science

Nice Question

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

earned this badge 18 times.
Diophantine equations and complexity classes
Awarded Jan 8, 2021 at 10:55
Major open problems on polynomial kernel (non) existence
Awarded Oct 13, 2020 at 16:57
Languages that we cannot (dis)prove to be Context-Free
Awarded Apr 6, 2019 at 0:20
Is { ww' | HamDist(w,w')>1 } context-free?
Awarded Jan 16, 2019 at 22:15
Polynomial kernel for $k$-FLIP SAT on $3$-CNF formulas
Awarded Jan 21, 2016 at 22:41
s-t connectivity on infinite planar graphs with finite description
Awarded Apr 7, 2015 at 10:20
Problems not known to be PSPACE-complete
Awarded Mar 11, 2015 at 5:41
Conjecture about two counters automata
Awarded Jan 13, 2015 at 9:02
"Snake" reconfiguration problem
Awarded Dec 21, 2014 at 18:38
Natural NP-complete problems with "large" witnesses
Awarded Oct 27, 2014 at 18:47
Hamiltonian cycle on graphs without small cycles
Awarded Jul 9, 2014 at 6:30
"Tiny" Graph Isomorphism
Awarded Jun 8, 2014 at 4:21
Testing isomorphism of asymmetric graphs
Awarded Apr 13, 2014 at 22:01
P with integer factorization oracle
Awarded Mar 31, 2014 at 16:29
Can a two counters machine decide $n^2$?
Awarded Feb 23, 2014 at 20:12
Winning strategy of an "edge or isolated vertex" deletion game
Awarded Jan 28, 2013 at 23:48
Is this language recognizable by a 3 symbols TM in O(n log n)?
Awarded Feb 17, 2012 at 11:44
Complexity of a switch network problem
Awarded Dec 27, 2011 at 17:14

Others with this badge