2026-08-15T23:18:19Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4342 2024-03-06T10:26:03Z ddc:004 open_access

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331) Husfeldt, Thore Paturi, Ramamohan Sorkin, Gregory B. Williams, Ryan Algorithms exponential time algorithms exact algorithms computational complexity satisfiability 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Thore Husfeldt and Ramamohan Paturi and Gregory B. Sorkin and Ryan Williams 2013 Is Part Of Dagstuhl Reports, Volume 3, Issue 8 (2013) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.3.8.40 urn:nbn:de:0030-drops-43422 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.8.40 eng https://creativecommons.org/licenses/by/3.0/legalcode