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.06391.1
URN: urn:nbn:de:0030-drops-8782
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2007/878/
Go to the corresponding Portal

Dahlke, Stephan ; Ritter, Klaus ; Sloan, Ian H. ; Traub, Joseph F.

06391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems

pdf-format:
06391_abstracts_collection.878.pdf (0.3 MB)

Abstract

From 24.09.06 to 29.09.06, the Dagstuhl Seminar 06391 ``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{dahlke_et_al:DagSemProc.06391.1,
  author =	{Dahlke, Stephan and Ritter, Klaus and Sloan, Ian H. and Traub, Joseph F.},
  title =	{{06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  pages =	{1--21},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6391},
  editor =	{Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/878},
  URN =		{urn:nbn:de:0030-drops-8782},
  doi =		{10.4230/DagSemProc.06391.1},
  annote =	{Keywords: Computational complexity, partial information, high-dimensional problems, operator equations, non-linear approximation, quantum computation, stochastic computation, ill posed-problems}
}

Keywords: Computational complexity, partial information, high-dimensional problems, operator equations, non-linear approximation, quantum computation,
Freie Schlagwörter (englisch): stochastic computation, ill posed-problems
Collection: 06391 - Algorithms and Complexity for Continuous Problems
Issue Date: 2007
Date of publication: 31.01.2007

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