BibTeX record conf/stoc/ThapperZ13

download as .bib file

@inproceedings{DBLP:conf/stoc/ThapperZ13,
  author       = {Johan Thapper and
                  Stanislav Zivn{\'{y}}},
  editor       = {Dan Boneh and
                  Tim Roughgarden and
                  Joan Feigenbaum},
  title        = {The complexity of finite-valued CSPs},
  booktitle    = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
                  USA, June 1-4, 2013},
  pages        = {695--704},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2488608.2488697},
  doi          = {10.1145/2488608.2488697},
  timestamp    = {Mon, 03 Aug 2020 17:29:58 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ThapperZ13.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.