On the Complexity of Random Satisfiability Problems with Planted Solutions
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

Vitaly Feldman, Will Perkins, Santosh Vempala
On the Complexity of Random Satisfiability Problems with Planted Solutions
STOC, 2015.

STOC 2015
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2015-FeldmanPV,
	author        = "Vitaly Feldman and Will Perkins and Santosh Vempala",
	booktitle     = "{Proceedings of the 47th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/2746539.2746577",
	isbn          = "978-1-4503-3536-2",
	pages         = "77--86",
	publisher     = "{ACM}",
	title         = "{On the Complexity of Random Satisfiability Problems with Planted Solutions}",
	year          = 2015,
}

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.