A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Report from Dagstuhl Seminar 13331 Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time
unpublished
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
fatcat:habdxvogxvgnxmg6n624f3y37y