Document Open Access Logo

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

Authors Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.8.9.1.pdf
  • Filesize: 6.59 MB
  • 28 pages

Document Identifiers

Subject Classification

Keywords
  • Computability and complexity in analysis
  • computations on real numbers
  • reducibilities
  • descriptive complexity
  • computational complexity
  • reverse and

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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).

Cite As Get BibTex

Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, and Arno Pauly. Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361). In Dagstuhl Reports, Volume 8, Issue 9, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/DagRep.8.9.1

Author Details

Vasco Brattka
Damir D. Dzhafarov
Alberto Marcone
Arno Pauly
and all authors of the abstracts in this report
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact