License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.3.8.40
URN: urn:nbn:de:0030-drops-43422
URL: http://drops.dagstuhl.de/opus/volltexte/2013/4342/
Go back to Dagstuhl Reports


Husfeldt, Thore ; Paturi, Ramamohan ; Sorkin, Gregory B. ; Williams, Ryan
Weitere Beteiligte (Hrsg. etc.): Thore Husfeldt and Ramamohan Paturi and Gregory B. Sorkin and Ryan Williams

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

pdf-format:
dagrep_v003_i008_p040_s13331.pdf (1 MB)


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.

BibTeX - Entry

@Article{husfeldt_et_al:DR:2013:4342,
  author =	{Thore Husfeldt and Ramamohan Paturi and Gregory B. Sorkin and Ryan Williams},
  title =	{{Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)}},
  pages =	{40--72},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{8},
  editor =	{Thore Husfeldt and Ramamohan Paturi and Gregory B. Sorkin and Ryan Williams},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4342},
  URN =		{urn:nbn:de:0030-drops-43422},
  doi =		{10.4230/DagRep.3.8.40},
  annote =	{Keywords: Algorithms, exponential time algorithms, exact algorithms, computational complexity, satisfiability}
}

Keywords: Algorithms, exponential time algorithms, exact algorithms, computational complexity, satisfiability
Seminar: Dagstuhl Reports, Volume 3, Issue 8
Issue Date: 2013
Date of publication: 11.12.2013


DROPS-Home | Fulltext Search | Imprint Published by LZI