Pages that link to "Item:Q2638754"
From MaRDI portal
The following pages link to On average case complexity of linear problems with noisy information (Q2638754):
Displaying 6 items.
- Noisy information for linear problems in the asymptotic setting (Q806961) (← links)
- Function approximation and integration on the Wiener space with noisy data (Q1201160) (← links)
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information (Q1635841) (← links)
- Complexity of approximating Hölder classes from information with varying Gaussian noise (Q2192676) (← links)
- On the minimal cost of approximating linear problems based on information with deterministic noise (Q3474221) (← links)
- Learning Curves for Gaussian Process Regression: Approximations and Bounds (Q4542429) (← links)