04401 Abstracts Collection – Algorithms and Complexity for Continuous

Authors Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub



PDF
Thumbnail PDF

File

DagSemProc.04401.1.pdf
  • Filesize: 251 kB
  • 21 pages

Document Identifiers

Author Details

Thomas Müller-Gronbach
Erich Novak
Knut Petras
Joseph F. Traub

Cite AsGet BibTex

Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub. 04401 Abstracts Collection – Algorithms and Complexity for Continuous. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.04401.1

Abstract

From 26.09.04 to 01.10.04, the Dagstuhl Seminar ``Algorithms and Complexity for Continuous Problems'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas 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.
Keywords
  • Complexity and regularization of ill-posed problems
  • nonlinear approximation
  • tractability of high-dimensional numerical problems quantum computing
  • stochastic computation and quantization
  • global optimization
  • differential and integral equations

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail