DagRep.4.10.51.pdf
- Filesize: 0.81 MB
- 18 pages
Document
Optimal algorithms and proofs (Dagstuhl Seminar 14421)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 4, Issue 10
Volume: Dagstuhl Reports, Volume 4
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2015-02-17
Cite AsGet BibTex
Olaf Beyersdorff, Edward A. Hirsch, Jan Krajicek, and Rahul Santhanam. Optimal algorithms and proofs (Dagstuhl Seminar 14421). In Dagstuhl Reports, Volume 4, Issue 10, pp. 51-68, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/DagRep.4.10.51
https://doi.org/10.4230/DagRep.4.10.51
Abstract
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.
Keywords
- computational complexity
- proof complexity
- approximation algorithms
- optimal algorithms
- optimal proof systems
- speedup theorems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads