Different approaches to proof systems

DOI10.1007/978-3-642-13562-0_6MaRDI QIDQ3569063zbMATH OpenOpenAlexWikidataFDO

Authors Olaf Beyersdorff, Sebastian Müller

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13562-0_6

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• scientific article; zbMATH DE number 1072531
• Proof Complexity of Non-classical Logics
• Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes
• scientific article; zbMATH DE number 1179974
• Proof complexity modulo the polynomial hierarchy: understanding alternation as a source of hardness

Cited in

(3)

• Some definitorial suggestions for parameterized proof complexity
• Proof complexity modulo the polynomial hierarchy: understanding alternation as a source of hardness
• Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes

This page was built for publication: Different approaches to proof systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569063)