Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time: Dagstuhl Seminar 13331

Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams

Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

Originalsprog	Engelsk
Tidsskrift	Dagstuhl Seminar Proceedings
Vol/bind	3
Udgave nummer	8
Sider (fra-til)	40-72
Antal sider	33
ISSN	1862-4405
DOI	https://doi.org/10.4230/DagRep.3.8.40
Status	Udgivet - 2013

Adgang til dokumentet

@article{bc59e873c5f74606981775ddb66e95d6,

title = "Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time: Dagstuhl Seminar 13331",

author = "Thore Husfeldt and Ramamohan Paturi and Sorkin, {Gregory B.} and Ryan Williams",

year = "2013",

doi = "http://dx.doi.org/10.4230/DagRep.3.8.40",

language = "English",

volume = "3",

pages = "40--72",

journal = "Dagstuhl Seminar Proceedings",

issn = "1862-4405",

publisher = "International Conference and Research Center for Computer Science, Schloss Dagstuhl gGmbH",

number = "8",

}

TY - JOUR

T1 - Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time

T2 - Dagstuhl Seminar 13331

AU - Husfeldt, Thore

AU - Paturi, Ramamohan

AU - Sorkin, Gregory B.

AU - Williams, Ryan

PY - 2013

Y1 - 2013

U2 - http://dx.doi.org/10.4230/DagRep.3.8.40

DO - http://dx.doi.org/10.4230/DagRep.3.8.40

M3 - Journal article

SN - 1862-4405

VL - 3

SP - 40

EP - 72

JO - Dagstuhl Seminar Proceedings

JF - Dagstuhl Seminar Proceedings

IS - 8

ER -