DagSemProc.06391.1.pdf
- Filesize: 263 kB
- 21 pages
Document
06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6391
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2007-01-31
Cite AsGet BibTex
Stephan Dahlke, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. 06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.06391.1
https://doi.org/10.4230/DagSemProc.06391.1
Abstract
From 24.09.06 to 29.09.06, the Dagstuhl Seminar 06391 ``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.
Keywords
- Computational complexity
- partial information
- high-dimensional problems
- operator equations
- non-linear approximation
- quantum computation
- stochastic computation
- ill posed-problems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads