License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.4.10.51
URN: urn:nbn:de:0030-drops-48923
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/4892/
Go back to Dagstuhl Reports

Beyersdorff, Olaf ; Hirsch, Edward A. ; Krajicek, Jan ; Santhanam, Rahul
Weitere Beteiligte (Hrsg. etc.): Olaf Beyersdorff and Edward A. Hirsch and Jan Krajicek and Rahul Santhanam

Optimal algorithms and proofs (Dagstuhl Seminar 14421)

pdf-format:
dagrep_v004_i010_p051_s14421.pdf (0.8 MB)

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.

BibTeX - Entry

@Article{beyersdorff_et_al:DR:2015:4892,
  author =	{Olaf Beyersdorff and Edward A. Hirsch and Jan Krajicek and Rahul Santhanam},
  title =	{{Optimal algorithms and proofs (Dagstuhl Seminar 14421)}},
  pages =	{51--68},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{10},
  editor =	{Olaf Beyersdorff and Edward A. Hirsch and Jan Krajicek and Rahul Santhanam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/4892},
  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}
}

Keywords: computational complexity, proof complexity, approximation algorithms, optimal algorithms, optimal proof systems, speedup theorems
Collection: Dagstuhl Reports, Volume 4, Issue 10
Issue Date: 2015
Date of publication: 17.02.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI