DagSemProc.08431.3.pdf
- Filesize: 103 kB
- 8 pages
Document
08431 Open Problems – Moderately Exponential Time Algorithms
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8431
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-12-23
Cite AsGet BibTex
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan van Rooij, and Ryan Williams. 08431 Open Problems – Moderately Exponential Time Algorithms. In Moderately Exponential Time Algorithms. Dagstuhl Seminar Proceedings, Volume 8431, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08431.3
https://doi.org/10.4230/DagSemProc.08431.3
Abstract
Two problem sessions were part of the seminar on Moderately Exponential Time Algorithms. Some of the open problems presented at those sessions have been collected.
Keywords
- Algorithms
- NP-hard problems
- Moderately Exponential Time Algorithms
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads