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.
Consequences of $\oplus \mathbf{P} \subseteq \mathbf{NP}$
Awarded Dec 25 '19 at 17:50
Compactly representing the solution set of a SAT instance
Awarded Jun 27 '17 at 23:31
Complexity of computing the parity of read-twice opposite CNF formula ($\oplus\text{Rtw-Opp-CNF}$)
Awarded Apr 19 '16 at 11:33
Unique $k$-SAT benchmarks
Awarded Sep 16 '13 at 17:13
Restricted Monotone 3CNF formula: counting satisfying assignments (both modulo $2^n$ and modulo $2$)
Awarded Jun 9 '13 at 14:55
Consensus on P = NP in a world where RP = NP
Awarded Jan 23 '13 at 3:11
0-1 Linear Programming: computing the Optimal Formulation
Awarded Dec 20 '12 at 1:39
Reasons for which a graph may be not $k$ colorable?
Awarded Dec 1 '12 at 1:03
Lower bounds on #SAT?
Awarded Sep 11 '12 at 16:46
Measuring the randomness of CNF formulas
Awarded Sep 11 '12 at 16:46
Counting the number of vertex covers: when is it hard?
Awarded Sep 11 '12 at 16:46
Shortest Equivalent CNF Formula
Awarded Jan 24 '12 at 9:30
Amplitude of Random Cubic Graphs
Awarded Dec 19 '11 at 15:11
#SAT Solver download
Awarded Jun 18 '11 at 17:39
Consequences of $SAT \in BQP$
Awarded Apr 18 '11 at 17:51
Consequences of Factoring being in P?
Awarded Feb 25 '11 at 3:18
Consequences of #P = FP
Awarded Feb 13 '11 at 17:56
Counting solutions of Monotone-2CNF formulas
Awarded Oct 12 '10 at 14:51

Others with this badge