2026-08-10T11:03:08Z https://drops.dagstuhl.de/oai

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

Optimal algorithms and proofs (Dagstuhl Seminar 14421) Beyersdorff, Olaf Hirsch, Edward A. Krajicek, Jan Santhanam, Rahul computational complexity proof complexity approximation algorithms optimal algorithms optimal proof systems speedup theorems This report documents the programme and the outcomes of the Dagstuhl Seminar 14421 "Optimal algorithms and proofs". The seminar brought together researchers working in computational and proof complexity, logic, and the theory of approximations. Each of these areas has its own, but connected notion of optimality; and the main aim of the seminar was to bring together researchers from these different areas, for an exchange of ideas, techniques, and open questions, thereby triggering new research collaborations across established research boundaries. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Olaf Beyersdorff and Edward A. Hirsch and Jan Krajicek and Rahul Santhanam 2015 Is Part Of Dagstuhl Reports, Volume 4, Issue 10 (2015) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.4.10.51 urn:nbn:de:0030-drops-48923 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.10.51 eng https://creativecommons.org/licenses/by/3.0/legalcode