Modular coloring formulas are hard for cutting planes proofs

Authors:
Xudong Fu
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 3G4
Venue:
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Year:
1996

Hard examples for resolution

Journal of the ACM (JACM)
On the complexity of cutting-plane proofs

Discrete Applied Mathematics
Many hard examples for resolution

Journal of the ACM (JACM)
Exponential lower bounds for the pigeonhole principle

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The independence of the modulo p counting principles

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds to the size of constant-depth propositional proofs

Journal of Symbolic Logic
Lower bounds for cutting planes proofs with small coefficients

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Hi-index	0.00