BibTeX record conf/stacs/DyerGJR10

download as .bib file

@inproceedings{DBLP:conf/stacs/DyerGJR10,
  author       = {Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Markus Jalsenius and
                  David Richerby},
  editor       = {Jean{-}Yves Marion and
                  Thomas Schwentick},
  title        = {The Complexity of Approximating Bounded-Degree Boolean {\#}CSP},
  booktitle    = {27th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2010, March 4-6, 2010, Nancy, France},
  series       = {LIPIcs},
  volume       = {5},
  pages        = {323--334},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2010},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2010.2466},
  doi          = {10.4230/LIPICS.STACS.2010.2466},
  timestamp    = {Sun, 02 Oct 2022 16:16:10 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DyerGJR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.