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

DOI10.1007/978-3-642-39071-5_26zbMATH Open1390.03046OpenAlexW202109148WikidataQ61732583 ScholiaQ61732583MaRDI QIDQ5326475FDOQ5326475

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

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

Mathematics Subject Classification ID

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

Cited In (6)

• Lower bounds for cutting planes proofs with small coefficients
• Title not available (Why is that?)
• A note on propositional proof complexity of some Ramsey-type statements
• Upper and lower Ramsey bounds in bounded arithmetic
• A rank lower bound for cutting planes proofs of Ramsey's theorem
• Title not available (Why is that?)

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)