47 citations · 245 across the 29 of their papers we have counts for
Showing 2019 · math.NAShow all
2 papers · 2 filters
math.NA2019
Algorithms and Complexity for Functions on General Domains
Erich Novak
Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a…
math.NA2019
On the power of random information
Aicke Hinrichs, David Krieg, Erich Novak +2
We study approximation and integration problems and compare the quality of optimal information with the quality of random information. For some problems random information is almos…