Modular Coloring Formulas Are Hard for Cutting Planes Proofs
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

Xudong Fu
Modular Coloring Formulas Are Hard for Cutting Planes Proofs
STOC, 1996.

STOC 1996
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1996-Fu,
	author        = "Xudong Fu",
	booktitle     = "{Proceedings of the 28th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/237814.238008",
	isbn          = "0-89791-785-5",
	pages         = "595--602",
	publisher     = "{ACM}",
	title         = "{Modular Coloring Formulas Are Hard for Cutting Planes Proofs}",
	year          = 1996,
}

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.