pdf-format: |
|
@InProceedings{husfeldt_et_al:DagSemProc.10441.1, author = {Husfeldt, Thore and Kratsch, Dieter and Paturi, Ramamohan and Sorkin, Gregory B.}, title = {{10441 Abstracts Collection – Exact Complexity of NP-hard Problems}}, booktitle = {Exact Complexity of NP-hard Problems}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10441}, editor = {Thore Husfeldt and Dieter Kratsch and Ramamohan Paturi and Gregory B. Sorkin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2011/2936}, URN = {urn:nbn:de:0030-drops-29363}, doi = {10.4230/DagSemProc.10441.1}, annote = {Keywords: Complexity, Algorithms, NP-hard Problems, Exponential Time, SAT, Graphs} }
Keywords: | Complexity, Algorithms, NP-hard Problems, Exponential Time, SAT, Graphs | |
Seminar: | 10441 - Exact Complexity of NP-hard Problems | |
Issue date: | 2011 | |
Date of publication: | 27.01.2011 |