Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361)
Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361)
复制标题
测量计算内容的复杂性：从组合问题到分析（Dagstuhl 研讨会 18361）
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
A. Pauly
中科院分区：
文献类型：
--
作者：
V. Brattka;D. Dzhafarov;Alberto Marcone;A. Pauly
本报告记录了Dagstuhl研讨会18361“测量计算内容的复杂性：从组合问题到分析”的计划和成果。它包括研讨会期间提出的谈话摘要和讨论的开放问题，以及在上次会议（Dagstuhl研讨会15392）期间开始的关于Weihrauch复杂性的参考书目，并在此期间看到了一些显着的增长。“已解决的问题”部分致力于解决上次会议（Dagstuhl研讨会15392）中提出的一些开放性问题。
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).