scientific article; zbMATH DE number 3675205
From MaRDI portal
Publication:3871809
Combinatorial aspects of packing and covering (05B40) Approximate quadratures (41A55) Multidimensional problems (41A63) Numerical methods in optimal control (49M99) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Numerical quadrature and cubature formulas (65D32) Numerical optimization and variational techniques (65K10)
Cited in
(13)- Delayed curse of dimension for Gaussian integration
- On average case errors in numerical analysis
- Algorithms and complexity for functions on general domains
- Multilevel Picard approximations for McKean-Vlasov stochastic differential equations
- On optimal recovery of integrals of random processes
- Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions
- The curse of dimensionality for numerical integration of smooth functions. II
- The curse of dimensionality for numerical integration of smooth functions
- Product rules are optimal for numerical integration in classical smoothness spaces
- The Monte Carlo Algorithm with a Pseudorandom Generator
- On the Wasserstein distance between classical sequences and the Lebesgue measure
- Learning the maximum of a Hölder function from inexact data
- Approximation of functions: optimal sampling and complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3871809)
