BibTeX record conf/dagstuhl/KrokhinZ17

download as .bib file

@incollection{DBLP:conf/dagstuhl/KrokhinZ17,
  author       = {Andrei A. Krokhin and
                  Stanislav Zivn{\'{y}}},
  editor       = {Andrei A. Krokhin and
                  Stanislav Zivn{\'{y}}},
  title        = {The Complexity of Valued CSPs},
  booktitle    = {The Constraint Satisfaction Problem: Complexity and Approximability},
  series       = {Dagstuhl Follow-Ups},
  volume       = {7},
  pages        = {233--266},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/DFU.Vol7.15301.9},
  doi          = {10.4230/DFU.VOL7.15301.9},
  timestamp    = {Mon, 03 Aug 2020 17:29:58 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/KrokhinZ17.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.