Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time

In English

Författare

Summary, in English

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.

Publiceringsår

2013

Språk

Engelska

Sidor

40-72

Publikation/Tidskrift/Serie

Dagstuhl Reports

Volym

3

Issue

8

Dokumenttyp

Artikel i tidskrift

Förlag

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Ämne

  • Computer Science

Status

Published

Projekt

  • Exact algorithms

Forskningsgrupp

  • Algorithms

ISBN/ISSN/Övrigt

  • ISSN: 2192-5283