Pages that link to "Item:Q2519328"
From MaRDI portal
The following pages link to The information-based complexity of approximation problem by adaptive Monte Carlo methods (Q2519328):
Displaying 5 items.
- Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods (Q722763) (← links)
- Random approximation of Sobolev embeddings (Q1179456) (← links)
- Optimal linear randomized methods for linear operators in Hilbert spaces (Q1190530) (← links)
- Lower bounds for the complexity of Monte Carlo function approximation (Q1201159) (← links)
- Kolmogorov and Linear Widths on Generalized Besov Classes in the Monte Carlo Setting (Q2917418) (← links)