DagRep.3.8.40.pdf
- Filesize: 1.33 MB
- 33 pages
Document
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 3, Issue 8
Volume: Dagstuhl Reports, Volume 3
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-12-11
Cite AsGet BibTex
Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, and Ryan Williams. Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). In Dagstuhl Reports, Volume 3, Issue 8, pp. 40-72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DagRep.3.8.40
https://doi.org/10.4230/DagRep.3.8.40
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar
13331 "Exponential Algorithms: Algorithms and Complexity Beyond
Polynomial Time". Problems are often solved in practice by algorithms with worst-case exponential time complexity. It is of interest to find the fastest algorithms for a given problem, be it polynomial, exponential, or something in between. The focus of the Seminar is on finer-grained notions of complexity
than np-completeness and on understanding the exact complexities of problems.
The report provides a rationale for the workshop and chronicles the presentations at the workshop. The report notes the progress on the open problems posed at the past workshops on the same topic. It also reports a collection of results that cite the presentations at the previous seminar. The docoument presents the collection of the abstracts of the results presented
at the Seminar. It also presents a compendium of open problems.
Keywords
- Algorithms
- exponential time algorithms
- exact algorithms
- computational complexity
- satisfiability
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads