Müller-Gronbach, Thomas ;
Plaskota, Leszek ;
Traub, Joseph F.
09391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems
Abstract
From 20.09.09 to 25.09.09, the Dagstuhl Seminar 09391
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 are put together in this paper. The
first section describes the seminar topics and goals in general. Links to
extended abstracts or full papers are provided, if available.
BibTeX - Entry
@InProceedings{mllergronbach_et_al:DSP:2009:2300,
author = {Thomas M{\"u}ller-Gronbach and Leszek Plaskota and Joseph F. Traub},
title = {09391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems},
booktitle = {Algorithms and Complexity for Continuous Problems},
year = {2009},
editor = {Thomas M{\"u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub},
number = {09391},
series = {Dagstuhl Seminar Proceedings},
ISSN = {1862-4405},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2009/2300},
annote = {Keywords: Computational complexity of continuous problems, partial information, high-dimensional problems, tractability analysis, quasi-Monte Carlo methods, op}
}
|
Keywords: |
|
Computational complexity of continuous problems, partial information, high-dimensional problems, tractability analysis, quasi-Monte Carlo methods, op |
|
Freie Schlagwörter (englisch): |
|
operator equations, non-linear approximation, stochastic computation, ill posed-problems |
|
Seminar: |
|
09391 - Algorithms and Complexity for Continuous Problems
|
|
Issue date: |
|
2009 |
|
Date of publication: |
|
02.12.2009 |
