On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
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

Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
STOC, 1998.

STOC 1998
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1998-BeameKPS,
	author        = "Paul Beame and Richard M. Karp and Toniann Pitassi and Michael E. Saks",
	booktitle     = "{Proceedings of the 30th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/276698.276870",
	isbn          = "0-89791-962-9",
	pages         = "561--571",
	publisher     = "{ACM}",
	title         = "{On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas}",
	year          = 1998,
}

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.