Untitled
Work
Year: 2006
Type: article
Abstract: We present a new method for proving rank lower bounds for the cutting planes procedures of Gomory and Chvátal (GC) and Lovász and Schrijver (LS), when viewed as proof systems for unsatisfiability.We a... more
Source: Theory of Computing
Cites: 42
Cited by: 67
Related to: 10
FWCI: 3.638
Citation percentile (by year/subfield): 86.47
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid