@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,
}