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.8.9.1
URN: urn:nbn:de:0030-drops-103270
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10327/
Go back to Dagstuhl Reports

Brattka, Vasco ; Dzhafarov, Damir D. ; Marcone, Alberto ; Pauly, Arno
Weitere Beteiligte (Hrsg. etc.): Vasco Brattka and Damir D. Dzhafarov and Alberto Marcone and Arno Pauly

Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361)

pdf-format:
dagrep_v008_i009_p001_18361.pdf (7 MB)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 18361 "Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis". It includes abstracts of talks presented during the seminar and open problems that were discussed, as well as a bibliography on Weihrauch complexity that was started during the previous meeting (Dagstuhl seminar 15392) and that saw some significant growth in the meantime. The session "Solved problems" is dedicated to the solutions to some of the open questions raised in the previous meeting (Dagstuhl seminar 15392).

BibTeX - Entry

@Article{brattka_et_al:DR:2019:10327,
  author =	{Vasco Brattka and Damir D. Dzhafarov and Alberto Marcone and Arno Pauly},
  title =	{{Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361)}},
  pages =	{1--28},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{9},
  editor =	{Vasco Brattka and Damir D. Dzhafarov and Alberto Marcone and Arno Pauly},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10327},
  URN =		{urn:nbn:de:0030-drops-103270},
  doi =		{10.4230/DagRep.8.9.1},
  annote =	{Keywords: Computability and complexity in analysis, computations on real numbers, reducibilities, descriptive complexity, computational complexity, reverse and}
}

Keywords: Computability and complexity in analysis, computations on real numbers, reducibilities, descriptive complexity, computational complexity, reverse and
Collection: Dagstuhl Reports, Volume 8, Issue 9
Issue Date: 2019
Date of publication: 20.03.2019

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