The relative efficiency of propositional proof systems

DOI10.1145/3588287.3588299MaRDI QIDQ6979510zbMATH OpenFDO

Authors Stephen Cook, Robert A. Reckhow

Publication date 25 May 2025

Full work available at URL https://doi.org/10.1145/3588287.3588299

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Computer science (68-XX) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3122413 (Why is no real title available?)
• scientific article; zbMATH DE number 3687372 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3583767 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• Reducibility among combinatorial problems
• The complexity of theorem-proving procedures
• Zur Hilbertschen Beweistheorie.

Cited in

(2)

• Circuits, proofs and propositional model counting
• Refuting perfect matchings in spectral expanders is hard

This page was built for publication: The relative efficiency of propositional proof systems

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