DagSemProc.09391.1.pdf
- Filesize: 288 kB
- 23 pages
Document
09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9391
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2009-12-02
Cite As Get BibTex
Thomas Müller-Gronbach, Leszek Plaskota, and Joseph F. Traub. 09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09391.1
Abstract
From 20.09.09 to 25.09.09, the Dagstuhl Seminar 09391 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 are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Subject Classification
Keywords
- Computational complexity of continuous problems
- partial information
- high-dimensional problems
- tractability analysis
- quasi-Monte Carlo methods
- op operator equations
- non-linear approximation
- stochastic computation
- ill posed-problems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads