Algorithms and Complexity for Continuous Problems

Summary

The Dagstuhl-Seminar on Algorithms and Complexity for Continuous Problems was attended by 44 scientists from 12 countries. We express our gratitude to the staff of Schloß Dagstuhl for providing a great atmosphere.

Continuous algorithms and complexity is a very rich and rapidly changing area. It relates to many other areas of computer science and mathematics, of both theoretical and practical orientation. This seminar has emphasized some of the most dynamic topics like:

• Linear multivariate problems
• Operator equations
• Zero finding and computation of fixed points
• Global optimization
• Probabilistic analysis of algorithms
• Monte Carlo and quasi Monte Carlo methods
• Models of computation for continuous problems
• Complexity issues for wavelets and neural networks
• Numerical integration
• Large scientific computations
• Large financial computations.

The Dagstuhl-Seminar-Report contains the abstracts of 40 lectures in alphabetical order. We also had a plenary session on new research directions and open problems.