Complexity of Infinite-Dimensional Problems

Description

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.