Publication Overview

Holger Dell and Dieter van Melkebeek

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

Published in: STOC
Year: 2010
Pages: 251-260