Journal of the ACM (JACM)
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Many hard examples for resolution
Journal of the ACM (JACM)
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximation and small-depth Frege proofs
SIAM Journal on Computing
Exponential lower bounds for the pigeonhole principle
Computational Complexity
An exponential lower bound to the size of bounded depth Frege proofs of the Pigeonhole Principle
Random Structures & Algorithms
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
Computational Complexity
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Linear gaps between degrees for the polynomial calculus modulo distinct primes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Random CNF's are Hard for the Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations
ACM Transactions on Computational Logic (TOCL)
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We prove exponential lower bounds on the size of a bounded depth Frege proof of a Tseitin graph-based contradiction, whenever the underlying graph is an expander. This is the first example of a contradiction, naturally formalized as a 3-CNF, that has no short bounded depth Frege proofs. Previously, lower bounds of this type were known only for the pigeonhole principle and for Tseitin contradictions based on complete graphs.Our proof is a novel reduction of a Tseitin formula of an expander graph to the pigeonhole principle, in a manner resembling that done by Fu and Urquhart for complete graphs.In the proof we introduce a general method for removing extension variables without significantly increasing the proof size, which may be interesting in its own right.