Semantic Versus Syntactic Cutting Planes

DOI10.4230/LIPIcs.STACS.2016.35zbMath1388.03054OpenAlexW2296380816MaRDI QIDQ4601887

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

lower boundscutting planesproof complexity

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Related Items

Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes, A note on monotone real circuits, Unnamed Item, On semantic cutting planes with very small coefficients, Understanding cutting planes for QBFs