Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

Dell, H.; Melkebeek, D. van

by H. Dell, D. van Melkebeek

Reference:

Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (H. Dell, D. van Melkebeek), In Journal of ACM, volume 61, 2014.

Bibtex Entry:

@article{dm14,
	Author = {H. Dell and {D. van} Melkebeek},
	Date-Added = {2015-02-16 16:35:20 +0000},
	Date-Modified = {2016-01-31 14:53:23 +0000},
	Issue = {4},
	Journal = {Journal of ACM},
	Number = {23},
	Title = {Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses},
	Volume = {61},
	Year = {2014},
	Bdsk-Url-1 = {http://dx.doi.org/10.1145/2629620}}