Dagstuhl Seminar 9116
Algorithms and Complexity of Continuous Problems
( Apr 15 – Apr 19, 1991 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/9116
Organizers
- E. Novak
- H. Wozniakowski
- J. Traub
Contact
Impacts
- Invited papers presented at the Schloss Dagstuhl workshop on continuous algorithms and complexity : April 15 - 19, 1991 - Academic Press, 1992 - (Journal of complexity ; 8. 1992, 2, S. 153-202).
Many problems in science and engineering are described by continuous models. Yet, most work to date on computational complexity has been for combinatorial or algebraic complexity. Recently there has been considerable research on the complexity of continuous problems and the Dagstuhl-Seminar was devoted to this subject. The topics, listed below in alphabetical order, are typical of the subjects covered at the Workshop. We list both theoretical and applied topics.
- Average Case Complexity
- Complexity of Nonlinear Problems
- Complexity of Parallel Computation
- Computational Models
- Intractable Problems
- Noisy Data
- Probabilistic Complexity
- Randomization (Monte Carlo Methods)
- Worst Case Complexity
- Approximation
- Control Theory
- Ill-Posed Problems
- Integral Equations
- Large Eigenvalue Problems
- Large Linear Systems
- Linear Optimization
- Multivariate Integration
- Nonlinear Equations
- Nonlinear Optimization
- Ordinary Differential Equations
- Partial Differential Equations
- Prediction and Estimation
- Signal Processing
- Zeros of Systems of Polynomials
Theoretical Topics
Applications
Creative Commons BY 3.0 Unported license
- E. Novak
- H. Wozniakowski
- J. Traub
Related Seminars
- Dagstuhl Seminar 9242: Algorithms and Complexity for Continuous Problems (1992-10-12 - 1992-10-16) (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)
