A rank lower bound for cutting planes proofs of Ramsey's theorem

DOI10.1007/978-3-642-39071-5_26MaRDI QIDQ5326475zbMATH OpenOpenAlexWikidataFDO

Authors Massimo Lauria

Publication date 5 August 2013

Published in Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39071-5_26

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Complexity of proofs (03F20)

Recommendations

• A rank lower bound for cutting planes proofs of Ramsey's theorem
• A note on propositional proof complexity of some Ramsey-type statements
• Upper and lower Ramsey bounds in bounded arithmetic
• scientific article; zbMATH DE number 1114021

Cited in

(6)

• scientific article; zbMATH DE number 1263234 (Why is no real title available?)
• A note on propositional proof complexity of some Ramsey-type statements
• Upper and lower Ramsey bounds in bounded arithmetic
• Lower bounds for cutting planes proofs with small coefficients
• A rank lower bound for cutting planes proofs of Ramsey's theorem
• scientific article; zbMATH DE number 1114021 (Why is no real title available?)

This page was built for publication: A rank lower bound for cutting planes proofs of Ramsey's theorem

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