Rank Lower Bounds for the Sherali-Adams Operator

DOI10.1007/978-3-540-73001-9_67zbMath1150.03339OpenAlexW1557126113MaRDI QIDQ5425367

Mark Rhodes

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_67

zbMATH Keywords

Propositional Proof ComplexityLift and Project Proof SystemsRank Lower BoundsSherali-Adams Relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Related Items (3)

Resolution Width and Cutting Plane Rank Are Incomparable ⋮ Tight rank lower bounds for the Sherali-Adams proof system ⋮ On the Chvátal rank of the pigeonhole principle

This page was built for publication: Rank Lower Bounds for the Sherali-Adams Operator