2026-07-26T02:45:53Z https://drops.dagstuhl.de/oai

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

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391) Hinrichs, Aicke Traub, Joseph F. Wozniakowski, Henryk Yaroslavtseva, Larisa High Dimensional Problems Tractability Random coefficients Multilevel algorithms computational stochastic processes Compressed sensing Learning theory From 20.09.15 to 25.09.15, the Dagstuhl Seminar 15391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts or the presentations given during the seminar can be found in this report. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Aicke Hinrichs and Joseph F. Traub and Henryk Wozniakowski and Larisa Yaroslavtseva 2016 Is Part Of Dagstuhl Reports, Volume 5, Issue 9 (2016) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.5.9.57 urn:nbn:de:0030-drops-56854 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.9.57 eng https://creativecommons.org/licenses/by/3.0/legalcode