Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Dieter van Melkebeek, Holger Dell. Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Electronic Colloquium on Computational Complexity (ECCC), 17:38, 2010. [doi]
Abstract is missing.