Dagstuhl Seminar 9242
Algorithms and Complexity for Continuous Problems
( Oct 12 – Oct 16, 1992 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/9242
Organizers
- E. Novak
- J.F. Traub
- St. Smale
Contact
The Dagstuhl-Seminar on Algorithms and Complexity of Continuous Problems was attended by 39 computer scientists and mathematicians from 12 countries. We express our gratitude to the staff of Schloß Dagstuhl for providing a great atmosphere. Our Seminar was devoted to the study of continuous problems such as computation over the reals, decision problems, problems with noisy data, numerical integration, optimal recovery, n-widths, partial differential equations, integral equations, zero finding, linear programming and image reconstruction.
The Report contains problems on finite dimensional as well as on infinite dimensional spaces. In the finite dimensional case the information is usually complete and the computational cost is crucial. In the infinite dimensional case the information is usually partial and in most of the research done so far the information cost is crucial. The Seminar-Report contains the abstracts of 32 lectures in alphabetical order. We also had a plenary session on new research directions and open questions.
Creative Commons BY 3.0 Unported license
- E. Novak
- J.F. Traub
- St. Smale
Related Seminars
- Dagstuhl Seminar 9116: Algorithms and Complexity of Continuous Problems (1991-04-15 - 1991-04-19) (Details)
- Dagstuhl Seminar 9442: Algorithms and Complexity for Continuous Problems (1994-10-17 - 1994-10-21) (Details)
- Dagstuhl Seminar 9643: Algorithms and Complexity for Continuous Problems (1996-10-21 - 1996-10-25) (Details)
- Dagstuhl Seminar 98201: Algorithms and Complexity for Continuous Problems (1998-05-18 - 1998-05-22) (Details)
- Dagstuhl Seminar 00391: Algorithms and Complexity for Continuous Problems (2000-09-24 - 2000-09-29) (Details)
- Dagstuhl Seminar 02401: Algorithms and Complexity for Continuous Problems (2002-09-29 - 2002-10-04) (Details)
- Dagstuhl Seminar 04401: Algorithms and Complexity for Continuous Problems (2004-09-26 - 2004-10-01) (Details)
- Dagstuhl Seminar 06391: Algorithms and Complexity for Continuous Problems (2006-09-24 - 2006-09-29) (Details)
- Dagstuhl Seminar 09391: Algorithms and Complexity for Continuous Problems (2009-09-20 - 2009-09-25) (Details)
- Dagstuhl Seminar 12391: Algorithms and Complexity for Continuous Problems (2012-09-23 - 2012-09-28) (Details)
- Dagstuhl Seminar 15391: Algorithms and Complexity for Continuous Problems (2015-09-20 - 2015-09-25) (Details)
- Dagstuhl Seminar 19341: Algorithms and Complexity for Continuous Problems (2019-08-18 - 2019-08-23) (Details)
- Dagstuhl Seminar 23351: Algorithms and Complexity for Continuous Problems (2023-08-27 - 2023-09-01) (Details)
- Dagstuhl Seminar 27341: Algorithms and Complexity for Continuous Problems (2027-08-22 - 2027-08-27) (Details)
