Abstract
We prove that the Cutting Plane proof system based on Gomory-Chvátal cuts polynomially simulates the lift-and-project system with integer coefficients written in unary. The restriction on the coefficients can be omitted when using Krajíček's cut-free Gentzen-style extension of both systems. We also prove that Tseitin tautologies have short proofs in this extension (of any of these systems and with any coefficients).
Original language | English |
---|---|
Pages (from-to) | 429-436 |
Number of pages | 8 |
Journal | Annals of Pure and Applied Logic |
Volume | 141 |
Issue number | 3 |
DOIs | |
State | Published - Sep 2006 |
Externally published | Yes |
Keywords
- Integer programming
- Propositional proof complexity