Randomized complexity of mean computation and the adaption problem

DOI10.1016/J.JCO.2024.101872MaRDI QIDQ6614418

Stefan Heinrich

Publication date: 7 October 2024

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

information-based complexityrandomized complexitymean computation

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tractability of multivariate problems. Volume I: Linear information
• Deterministic and stochastic error bounds in numerical analysis
• Monte Carlo complexity of global solution of integral equations
• Quantum summation with an application to integration.
• On the complexity of computing the \(L_q\) norm
• Monte Carlo approximation of weakly singular integral operators
• The randomized information complexity of elliptic PDE
• On the power of adaption
• Complexity of stochastic integration in Sobolev classes
• Optimal sequential and non-sequential procedures for evaluating a functional
• Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
• Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
• Randomized approximation of summable sequences -- adaptive and non-adaptive

Related Items (1)

Homogeneous algorithms and solvable problems on cones

This page was built for publication: Randomized complexity of mean computation and the adaption problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614418)