Resolution Width and Cutting Plane Rank Are Incomparable
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 1336257 (Why is no real title available?)
- scientific article; zbMATH DE number 1916823 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A combinatorial characterization of resolution width
- A complexity gap for tree resolution
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Edmonds polytopes and a hierarchy of combinatorial problems
- On the complexity of cutting-plane proofs
- Outline of an algorithm for integer solutions to linear programs
- Rank Lower Bounds for the Sherali-Adams Operator
- Rank bounds and integrality gaps for cutting planes procedures
- Relativisation Provides Natural Separations for Resolution-Based Proof Systems
- Short proofs are narrow—resolution made simple
- Theory and Applications of Satisfiability Testing
- Tight rank lower bounds for the Sherali-Adams proof system
Cited in
(4)
This page was built for publication: Resolution Width and Cutting Plane Rank Are Incomparable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599159)