Hard examples for bounded depth frege

DOI10.1145/509907.509988zbMATH Open1192.03041OpenAlexW2102977254MaRDI QIDQ3579189FDOQ3579189

Authors: Eli Ben-Sasson 

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Cited In (3)

• Proof Complexity Meets Algebra
• Propositional proof complexity
• Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs

This page was built for publication: Hard examples for bounded depth frege

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