Pages that link to "Item:Q1201159"
From MaRDI portal
The following pages link to Lower bounds for the complexity of Monte Carlo function approximation (Q1201159):
Displayed 9 items.
- Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure (Q706793) (← links)
- The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods (Q933418) (← links)
- On the power of standard information for \(L_{\infty}\) approximation in the randomized setting (Q1035792) (← links)
- Linear average and stochastic \(n\)-widths of Besov embeddings on Lipschitz domains (Q1040851) (← links)
- Linear widths of a multivariate function space equipped with a Gaussian measure (Q1763781) (← links)
- The randomized information complexity of elliptic PDE (Q2489143) (← links)
- Approximation characteristics for diagonal operators in different computational settings (Q2497232) (← links)
- The information-based complexity of approximation problem by adaptive Monte Carlo methods (Q2519328) (← links)
- The power of standard information for multivariate approximation in the randomized setting (Q3426031) (← links)