Randomized complexity of mean computation and the adaption problem
type: Item
instance of: scholarly article
title: Randomized complexity of mean computation and the adaption problem
author: Stefan Heinrich
published in: Journal of Complexity
publication date: 2024-10-07T00:00:00Z
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 7922212
zbMATH Keywords: information-based complexity
zbMATH Keywords: randomized complexity
zbMATH Keywords: mean computation
MaRDI profile type: Publication
cites work: Optimal sequential and non-sequential procedures for evaluating a functional
cites work: Monte Carlo complexity of global solution of integral equations
cites work: Quantum summation with an application to integration.
cites work: Monte Carlo approximation of weakly singular integral operators
cites work: The randomized information complexity of elliptic PDE
cites work: On the complexity of computing the \(L_q\) norm
cites work: Complexity of stochastic integration in Sobolev classes
cites work: Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
cites work: Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
cites work: Randomized approximation of summable sequences -- adaptive and non-adaptive
cites work: Deterministic and stochastic error bounds in numerical analysis
cites work: On the power of adaption
cites work: Tractability of multivariate problems. Volume I: Linear information
cites work: Q4183861
cites work: Q4040428
cites work: Q3883494
DOI: 10.1016/J.JCO.2024.101872
description: scientific article; zbMATH DE number 7922212