Document Open Access Logo

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)

Authors Alexander Keller, Frances Kuo, Andreas Neuenkirch, Joseph F. Traub and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.2.9.200.pdf
  • Filesize: 0.91 MB
  • 26 pages

Document Identifiers

Subject Classification

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)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get 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

Author Details

Alexander Keller
Frances Kuo
Andreas Neuenkirch
Joseph F. Traub
and all authors of the abstracts in this report
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
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact