Holger Dell, Dieter van Melkebeek. Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. Journal of the ACM, 61(4):23, 2014. [doi]
@article{DellM14,
title = {Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses},
author = {Holger Dell and Dieter van Melkebeek},
year = {2014},
doi = {10.1145/2629620},
url = {http://doi.acm.org/10.1145/2629620},
researchr = {https://researchr.org/publication/DellM14},
cites = {0},
citedby = {0},
journal = {Journal of the ACM},
volume = {61},
number = {4},
pages = {23},
}