September 24 – 29 , 2000, Dagstuhl Seminar 00391

Algorithms and Complexity for Continuous Problems


S. Heinrich (Kaiserslautern), S. Pereverzev (Kiew), J. Traub (New York), G. Wasilkowski (Lexington)

For support, please contact

Dagstuhl Service Team


Dagstuhl's Impact: Documents available
Dagstuhl-Seminar-Report 287


Continuous computational problems arise in diverse areas of science and engineering. There has been an increasing interest in computational aspects of multivariate problems. Examples include path and multivariate integration, function approximation, optimization, and operator equations. Understanding the complexity of such problems and construction of efficient algorithms is both important and challenging.

The main focus of this seminar will be on the complexity of such high dimensional problems and on their tractability. Efficient or, ideally, optimal algorithms will be presented. Since Monte Carloand/or quasi-Monte Carlo algorithms are often used for such problems, their efficiency will also be addressed. Models of computations and various settings (e.g., worst case, average case, or probabilistic) are important part of the complexity study and these will be discussed as well.

Dagstuhl Seminar Series


In the series Dagstuhl Reports each Dagstuhl Seminar and Dagstuhl Perspectives Workshop is documented. The seminar organizers, in cooperation with the collector, prepare a report that includes contributions from the participants' talks together with a summary of the seminar.


Download overview leaflet (PDF).

Dagstuhl's Impact

Please inform us when a publication was published as a result from your seminar. These publications are listed in the category Dagstuhl's Impact and are presented on a special shelf on the ground floor of the library.


Furthermore, a comprehensive peer-reviewed collection of research papers can be published in the series Dagstuhl Follow-Ups.