Publication Overview

Dieter van Melkebeek and Holger Dell

Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses

Published in: Electronic Colloquium on Computational Complexity (ECCC)
Year: 2010
Volume: 17
Pages: 38