DagRep.13.8.106.pdf
- Filesize: 3.91 MB
- 23 pages
Document
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 13, Issue 8
Volume: Dagstuhl Reports, Volume 13
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-03-13
Cite AsGet BibTex
Dmitriy Bilyk, Michael Gnewuch, Jan Vybíral, Larisa Yaroslavtseva, and Kumar Harsha. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351). In Dagstuhl Reports, Volume 13, Issue 8, pp. 106-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/DagRep.13.8.106
https://doi.org/10.4230/DagRep.13.8.106
Abstract
The Dagstuhl Seminar 23351 was held at the Leibniz Center for Informatics, Schloss Dagstuhl, from August 27 to September 1, 2023. This event was the 14th in a series of Dagstuhl Seminars, starting in 1991. During the seminar, researchers presented overview talks, recent research results, work in progress and open problems. The first section of this report describes the goal of the seminar, the main seminar topics, and the general structure of the seminar. The third section contains the abstracts of the talks given during the seminar and the forth section the problems presented at the problem session.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Approximation
- Mathematics of computing → Numerical analysis
- Mathematics of computing → Probabilistic algorithms
Keywords
- computational stochastics
- infinite-variate problems
- quasi-{M}onte {C}arlo
- sampling
- tractability analysis
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads