A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Massimo Lauria
A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem
ICST, 2013.

SAT 2013
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{SAT-2013-Lauria,
	author        = "Massimo Lauria",
	booktitle     = "{Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing}",
	doi           = "10.1007/978-3-642-39071-5_26",
	isbn          = "978-3-642-39070-8",
	pages         = "351--364",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem}",
	volume        = 7962,
	year          = 2013,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.