Published in: Dagstuhl Reports, Volume 4, Issue 10 (2015)
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)
@Article{beyersdorff_et_al:DagRep.4.10.51, author = {Beyersdorff, Olaf and Hirsch, Edward A. and Krajicek, Jan and Santhanam, Rahul}, title = {{Optimal algorithms and proofs (Dagstuhl Seminar 14421)}}, pages = {51--68}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2015}, volume = {4}, number = {10}, editor = {Beyersdorff, Olaf and Hirsch, Edward A. and Krajicek, Jan and Santhanam, Rahul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.10.51}, URN = {urn:nbn:de:0030-drops-48923}, doi = {10.4230/DagRep.4.10.51}, annote = {Keywords: computational complexity, proof complexity, approximation algorithms, optimal algorithms, optimal proof systems, speedup theorems} }
Feedback for Dagstuhl Publishing