FAQ
overflow
Great Answers to
Questions About Everything
Is 0-1 Programming with Constant Number of Constraints Polynomially Solvable?
Relationship between SPACE(n) & E
Boolean Functions with Exponential Size OBDD Representation in All Orders except One Order?
How Hard Is Counting the Number of Vertex Covers after a Small Perturbation?
Can It Be Determined If Language L Lies in NP?
Is the following Problem NP-Hard?
Sum versus Maximum in Computer Science
Are AND&OR Circuits P-complete?
Do There Exist X Such That K(xx) < K(x), Where K Is Kolmogorov Complextity
Physical Realization of Nonlinear Operators for Quantum Computers