BibTeX record journals/jacm/DellM14

download as .bib file

@article{DBLP:journals/jacm/DellM14,
  author    = {Holger Dell and
               Dieter van Melkebeek},
  title     = {Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time
               Hierarchy Collapses},
  journal   = {J. {ACM}},
  volume    = {61},
  number    = {4},
  pages     = {23:1--23:27},
  year      = {2014},
  url       = {https://doi.org/10.1145/2629620},
  doi       = {10.1145/2629620},
  timestamp = {Tue, 06 Nov 2018 12:51:44 +0100},
  biburl    = {https://dblp.org/rec/journals/jacm/DellM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics