Sciweavers

LATA
2009
Springer
14 years 5 months ago
Nondeterministic Instance Complexity and Proof Systems with Advice
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
Olaf Beyersdorff, Johannes Köbler, Sebastian ...