5 citations · 10 across the 14 of their papers we have counts for
15 papers
Randomized Complexity of Vector-Valued Approximation
Stefan Heinrich
We study the randomized -th minimal errors (and hence the complexity) of vector valued approximation. In a recent paper by the author [Randomized complexity of parametric integr…
Randomized Complexity of Parametric Integration and the Role of Adaption II. Sobolev Spaces
Stefan Heinrich
We study the complexity of randomized computation of integrals depending on a parameter, with integrands from Sobolev spaces. That is, for , $1\le p,q\le \…
Randomized Complexity of Parametric Integration and the Role of Adaption I. Finite Dimensional Case
Stefan Heinrich
We study the randomized -th minimal errors (and hence the complexity) of vector valued mean computation, which is the discrete version of parametric integration. The results of…
Lower bounds for the number of random bits in Monte Carlo algorithms
Stefan Heinrich
We continue the study of restricted Monte Carlo algorithms in a general setting. Here we show a lower bound for minimal errors in the setting with finite restriction in terms of de…
On the randomized complexity of Banach space valued integration
Stefan Heinrich, Aicke Hinrichs
We study the complexity of Banach space valued integration in the randomized setting. We are concerned with -times continuously differentiable functions on the -dimensional u…
Quantum Lower Bounds by Entropy Numbers
Stefan Heinrich
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexi…