License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09391.1
URN: urn:nbn:de:0030-drops-23005
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2300/
Go to the corresponding Portal

Müller-Gronbach, Thomas ; Plaskota, Leszek ; Traub, Joseph F.

09391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems

pdf-format:
09391_abstracts_collection.2300.pdf (0.3 MB)

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{mullergronbach_et_al:DagSemProc.09391.1,
  author =	{M\"{u}ller-Gronbach, Thomas and Plaskota, Leszek and Traub, Joseph F.},
  title =	{{09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  pages =	{1--23},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9391},
  editor =	{Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2009/2300},
  URN =		{urn:nbn:de:0030-drops-23005},
  doi =		{10.4230/DagSemProc.09391.1},
  annote =	{Keywords: Computational complexity of continuous problems, partial information, high-dimensional problems, tractability analysis, quasi-Monte Carlo methods, op operator equations, non-linear approximation, stochastic computation, ill posed-problems}
}

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
Collection: 09391 - Algorithms and Complexity for Continuous Problems
Issue Date: 2009
Date of publication: 02.12.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI