Several notes on the power of Gomory-Chvátal cuts

Edward A. Hirsch, Arist Kojevnikov

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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 languageEnglish
Pages (from-to)429-436
Number of pages8
JournalAnnals of Pure and Applied Logic
Issue number3
StatePublished - Sep 2006
Externally publishedYes


  • Integer programming
  • Propositional proof complexity


Dive into the research topics of 'Several notes on the power of Gomory-Chvátal cuts'. Together they form a unique fingerprint.

Cite this