Document Open Access Logo

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 19341)

Authors Dmitriy Bilyk, Aicke Hinrichs, Frances Y. Kuo, Klaus Ritter and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.9.8.26.pdf
  • Filesize: 3.22 MB
  • 23 pages

Document Identifiers

Subject Classification

Keywords
  • applied harmonic analysis
  • computational stochastics
  • computing and complexity in infinite dimensions
  • discrepancy theory
  • tractability analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

From 18.08. to 23.08.2019, the Dagstuhl Seminar 19341 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (LZI), 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

Dmitriy Bilyk, Aicke Hinrichs, Frances Y. Kuo, and Klaus Ritter. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 19341). In Dagstuhl Reports, Volume 9, Issue 8, pp. 26-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/DagRep.9.8.26

Author Details

Dmitriy Bilyk
Aicke Hinrichs
Frances Y. Kuo
Klaus Ritter
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