https://www.dagstuhl.de/12391
September 23 – 28 , 2012, Dagstuhl Seminar 12391
Algorithms and Complexity for Continuous Problems
Organizers
Alexander Keller (NVIDIA GmbH – Berlin, DE)
Frances Y. Kuo (UNSW – Sydney, AU)
Andreas Neuenkirch (Universität Mannheim, DE)
Joseph F. Traub (Columbia University – New York, US)
For support, please contact
Documents
Dagstuhl Report, Volume 2, Issue 9
List of Participants
Dagstuhl's Impact: Documents available
Dagstuhl Seminar Schedule [pdf]
Summary
This was already the 11th Dagstuhl Seminar on Algorithms and Complexity for Continuous Problems over a period of 21 years. It brought together researchers from different communities working on computational aspects of continuous problems, including computer scientists, numerical analysts, applied and pure mathematicians. Although the seminar title has remained the same many of the topics and participants change with each seminar and each seminar in this series is of a very interdisciplinary nature.
Continuous computational problems arise in diverse areas of science and engineering. Examples include path and multivariate integration, approximation, optimization, as well as operator equations. Typically, only partial and/or noisy information is available, and the aim is to solve the problem within a given error tolerance using the minimal amount of computational resources. For example, in high-dimensional integration one wants to compute an varepsilon-approximation to the integral with the minimal number of function evaluations. Here it is crucial to identify first the relevant variables of the function. Understanding the complexity of such problems and construction of efficient algorithms is both important and challenging.
The current seminar attracted 51 participants from more than 10 different countries all over the world. About 30% of them were young researchers including PhD students. There were 40 presentations covering in particular the following topics:
- Biomedical learning problems
- Random media
- Computational finance
- Noisy data
- Tractability
- Quantum computation
- Computational stochastic processes
- High-dimensional problems
The work of the attendants was supported by a variety of funding agencies. This includes the Deutsche Forschungsgemeinschaft, the Austrian Science Fund, the National Science Foundation (USA), and the Australian Research Council. Many of the attendants from Germany were supported within the DFG priority program SPP 1324 on "Extraction of Quantifiable Information from Complex Systems", which is strongly connected to the topics of the seminar.
As always, the excellent working conditions and friendly atmosphere provided by the Dagstuhl team have led to a rich exchange of ideas as well as a number of new collaborations. Selected papers related to this seminar will be published in a special issue of the Journal of Complexity.
Dagstuhl Seminar Series
- 23351: "Algorithms and Complexity for Continuous Problems" (2023)
- 19341: "Algorithms and Complexity for Continuous Problems" (2019)
- 15391: "Algorithms and Complexity for Continuous Problems" (2015)
- 09391: "Algorithms and Complexity for Continuous Problems" (2009)
- 06391: "Algorithms and Complexity for Continuous Problems " (2006)
- 04401: "Algorithms and Complexity for Continuous Problems" (2004)
- 02401: "Algorithms and Complexity for Continuous Problems" (2002)
- 00391: "Algorithms and Complexity for Continuous Problems" (2000)
- 98201: "Algorithms and Complexity for Continuous Problems" (1998)
- 9643: "Algorithms and Complexity for Continuous Problems" (1996)
- 9442: "Algorithms and Complexity for Continuous Problems" (1994)
- 9242: "Algorithms and Complexity for Continuous Problems" (1992)
- 9116: "Algorithms and Complexity of Continuous Problems" (1991)
Classification
- Data Structures/Algorithms/Complexity
Keywords
- Biomedical learning problems
- Random media
- Computational finance
- Noisy data
- Tractability
- Quantum computation
- Computational stochastic processes
- High-dimensional problems