Publication:4501542

zbMath0962.68154MaRDI QIDQ4501542

Martin Mundhenk, V. Arvind, Jacobo Toran, Johannes Köbler

Publication date: 4 September 2000

zbMATH Keywords

propositional proof system

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03F20: Complexity of proofs

Related Items

Proof systems that take advice, Nondeterministic Instance Complexity and Proof Systems with Advice