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.
@InProceedings{mullergronbach_et_al:DagSemProc.09391.1, author = {M\"{u}ller-Gronbach, Thomas and Plaskota, Leszek and Traub, Joseph F.}, title = {{09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--23}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.1}, URN = {urn:nbn:de:0030-drops-23005}, doi = {10.4230/DagSemProc.09391.1}, annote = {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} }
Feedback for Dagstuhl Publishing