The threshold for random k-SAT is 2k (ln 2 — O(k))
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

Dimitris Achlioptas, Yuval Peres
The threshold for random k-SAT is 2k (ln 2 — O(k))
STOC, 2003.

STOC 2003
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2003-AchlioptasP,
	author        = "Dimitris Achlioptas and Yuval Peres",
	booktitle     = "{Proceedings of the 35th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/780542.780577",
	isbn          = "1-58113-674-9",
	pages         = "223--231",
	publisher     = "{ACM}",
	title         = "{The threshold for random k-SAT is 2k (ln 2 — O(k))}",
	year          = 2003,
}

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.