7 search results - page 2 / 2 » Complexity of Propositional Proofs Under a Promise |
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
FSTTCS
1992
Springer
13 years 9 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...