DagRep.2.9.200.pdf
- Filesize: 0.91 MB
- 26 pages
Document
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 2, Issue 9
Volume: Dagstuhl Reports, Volume 2
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2013-02-20
Cite AsGet BibTex
Alexander Keller, Frances Kuo, Andreas Neuenkirch, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391). In Dagstuhl Reports, Volume 2, Issue 9, pp. 200-225, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DagRep.2.9.200
https://doi.org/10.4230/DagRep.2.9.200
Abstract
From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar can be found in this report. The
first section describes the seminar topics and goals in general. Links to
extended abstracts or full papers are provided, if available.
Keywords
- Computational complexity of continuous problems
- Partial information
- Biomedical learning problems
- Random media
- Computational finance
- Noisy data
- Tractability
- Quantum computation
- Computational stochastic processes
- High-dimensional problems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads