2026-07-25T12:50:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10327 2024-03-06T10:26:59Z ddc:004 open_access

Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361) Brattka, Vasco Dzhafarov, Damir D. Marcone, Alberto Pauly, Arno Computability and complexity in analysis computations on real numbers reducibilities descriptive complexity computational complexity reverse and 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). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vasco Brattka and Damir D. Dzhafarov and Alberto Marcone and Arno Pauly 2019 Is Part Of Dagstuhl Reports, Volume 8, Issue 9 (2019) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.8.9.1 urn:nbn:de:0030-drops-103270 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.9.1 eng https://creativecommons.org/licenses/by/3.0/legalcode