Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. (2010)

by Holger Dell, Dieter Van Melkebeek
Venue:In Proceedings of the 42nd ACM symposium on Theory of computing,