BibTeX record journals/eccc/MelkebeekD10

download as .bib file

@article{DBLP:journals/eccc/MelkebeekD10,
  author    = {Dieter van Melkebeek and
               Holger Dell},
  title     = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time
               Hierarchy Collapses},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {38},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/038},
  timestamp = {Tue, 14 Aug 2018 17:08:05 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/MelkebeekD10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics