@InProceedings{dell_et_al:DagSemProc.09511.7,
  author =	{Dell, Holger and van Melkebeek, Dieter},
  title =	{{Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses}},
  booktitle =	{Parameterized complexity and approximation algorithms},
  pages =	{1--29},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9511},
  editor =	{Erik D. Demaine and MohammadTaghi Hajiaghayi and D\'{a}niel Marx},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09511.7},
  URN =		{urn:nbn:de:0030-drops-25043},
  doi =		{10.4230/DagSemProc.09511.7},
  annote =	{Keywords: Sparsification, Kernelization, Parameterized Complexity, Probabilistically Checkable Proofs, Satisfiability, Vertex Cover}
}