Semantic versus syntactic cutting planes

DOI10.4230/LIPICS.STACS.2016.35MaRDI QIDQ4601887zbMATH OpenOpenAlexFDO

Authors Yuval Filmus, Massimo Lauria, Pavel Hrubeš

Publication date 24 January 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.STACS.2016.35

zbMATH Keywords

cutting planeslower boundsproof complexity

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• On semantic cutting planes with very small coefficients
• scientific article; zbMATH DE number 512977
• Cutting planes, connectivity, and threshold logic
• Lower bounds for resolution and cutting plane proofs and monotone computations
• Lower bounds for cutting planes proofs with small coefficients

Cited in

(8)

• A note on monotone real circuits
• On semantic cutting planes with very small coefficients
• Understanding cutting planes for QBFs
• scientific article; zbMATH DE number 1101590 (Why is no real title available?)
• Stabbing planes
• Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes
• On the power and limitations of branch and cut
• Extending merge resolution to a family of QBF-proof systems

This page was built for publication: Semantic versus syntactic cutting planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601887)