Note: On the Chvátal rank of the Pigeonhole Principle

Authors:
Mark Rhodes
Affiliations:
Department of Computer Science, University of Durham, South Road, Durham, DH1 3LE, UK
Venue:
Theoretical Computer Science
Year:
2009

Citing 5
Cited 0

On the complexity of cutting-plane proofs

Discrete Applied Mathematics
A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
Exponential lower bounds for the pigeonhole principle

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Cutting planes and the complexity of the integer hull

Cutting planes and the complexity of the integer hull
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

We demonstrate that the Cutting Plane (CP) rank, also known as the Chvatal rank, of the Pigeonhole Principle is @Q(logn). Our proof uses a novel technique which allows us to demonstrate rank lower bounds for fractional points with fewer restrictions than previous methods. We also demonstrate that the Pigeonhole Principle has a polynomially sized CP proof.