2026-07-20T07:29:07Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3892 2024-03-06T10:25:54Z ddc:004 open_access

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391) Keller, Alexander Kuo, Frances Neuenkirch, Andreas Traub, Joseph F. Computational complexity of continuous problems Partial information Biomedical learning problems Random media Computational finance Noisy data Tractability Quantum computation Computational stochastic processes High-dimensional problems From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 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 of 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 Alexander Keller and Frances Kuo and Andreas Neuenkirch and Joseph F. Traub 2013 Is Part Of Dagstuhl Reports, Volume 2, Issue 9 (2013) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.2.9.200 urn:nbn:de:0030-drops-38920 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.9.200 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode