Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/DFU.Vol7.15301
URN: urn:nbn:de:0030-drops-69752
URL: https://drops.dagstuhl.de/opus/volltexte/2017/6975/
Krokhin, Andrei ; Zivny, Stanislav
DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume
| pdf-format: |
|
Abstract
DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume
BibTeX - Entry
@Collection{DFU.Vol7.15301,
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 = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2017/6975},
URN = {urn:nbn:de:0030-drops-69752},
doi = {10.4230/DFU.Vol7.15301},
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 |
