BibTeX record conf/stoc/DellM10

download as .bib file

@inproceedings{DBLP:conf/stoc/DellM10,
  author    = {Holger Dell and
               Dieter van Melkebeek},
  editor    = {Leonard J. Schulman},
  title     = {Satisfiability allows no nontrivial sparsification unless the polynomial-time
               hierarchy collapses},
  booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  pages     = {251--260},
  publisher = {{ACM}},
  year      = {2010},
  url       = {https://doi.org/10.1145/1806689.1806725},
  doi       = {10.1145/1806689.1806725},
  timestamp = {Tue, 06 Nov 2018 11:07:06 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/DellM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics