License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-69752
URL: http://drops.dagstuhl.de/opus/volltexte/2017/6975/
Go to the corresponding DFU Volume Portal


Krokhin, Andrei ; Zivny, Stanislav

DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume

pdf-format:
dfu-vol7-complete.pdf (7 MB)


Abstract

DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume

BibTeX - Entry

@InCollection{krokhin_et_al:DFU:2017:6975,
  author =	{Andrei Krokhin and Stanislav Zivny},
  title =	{{DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume}},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-95977-003-3},
  ISSN =	{1868-8977},
  year =	{2017},
  volume =	{7},
  editor =	{Andrei Krokhin and Stanislav Zivny},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6975},
  URN =		{urn:nbn:de:0030-drops-69752},
  annote =	{Keywords: Nonnumerical Algorithms and Problems}
}

Keywords: Nonnumerical Algorithms and Problems
Seminar: The Constraint Satisfaction Problem: Complexity and Approximability
Issue Date: 2017
Date of publication: 22.02.2017


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI