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

Holger Dell, Dieter van Melkebeek

Browse the full STOC paper archive.