Research Meeting 22073
Complexity of Infinite-Dimensional Problems
( Feb 13 – Feb 18, 2022 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/22073
Organizer
- Klaus Ritter (TU Kaiserslautern, DE)
Contact
- Heike Clemens (for administrative matters)
New types of embedding theorems are needed to analyze computational problems for functions of infinitely-many variables within the framework of information-based complexity. We focus on embeddings between infinite tensor products of reproducing kernel Hilbert spaces. The embedding theorems will be employed to obtain new complexity results, but they also allow to simplify the existing theory and to substantially expand the applicability of well-established algorithms.
Klaus Ritter