Hard examples for bounded depth frege
From MaRDI portal
Publication:3579189
DOI10.1145/509907.509988zbMath1192.03041OpenAlexW2102977254MaRDI QIDQ3579189
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
Related Items (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