Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time

Husfeldt, Thore LU ; Paturi, Ramamohan ; Sorkin, Gregory B. and Williams, Ryan (2013) In Dagstuhl Reports 3(8). p.40-72
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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Dagstuhl Reports
volume
3
issue
8
pages
40 - 72
publisher
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
ISSN
2192-5283
DOI
10.4230/DagRep.3.8.40
project
Exact algorithms
language
English
LU publication?
yes
id
fc969166-86a0-4a14-bda8-4a05e288c89f (old id 4247280)
date added to LUP
2016-04-01 14:06:17
date last changed
2021-05-06 20:53:12
@article{fc969166-86a0-4a14-bda8-4a05e288c89f,
  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.}},
  author       = {{Husfeldt, Thore and Paturi, Ramamohan and Sorkin, Gregory B. and Williams, Ryan}},
  issn         = {{2192-5283}},
  language     = {{eng}},
  number       = {{8}},
  pages        = {{40--72}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  series       = {{Dagstuhl Reports}},
  title        = {{Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time}},
  url          = {{http://dx.doi.org/10.4230/DagRep.3.8.40}},
  doi          = {{10.4230/DagRep.3.8.40}},
  volume       = {{3}},
  year         = {{2013}},
}