Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
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

Holger Dell, Dieter van Melkebeek
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
STOC, 2010.

STOC 2010
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2010-DellM,
	author        = "Holger Dell and Dieter van Melkebeek",
	booktitle     = "{Proceedings of the 42nd Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/1806689.1806725",
	isbn          = "978-1-4503-0050-6",
	pages         = "251--260",
	publisher     = "{ACM}",
	title         = "{Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses}",
	year          = 2010,
}

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.