Pages that link to "Item:Q1893075"
From MaRDI portal
The following pages link to Average complexity for linear problems in a model with varying information noise (Q1893075):
Displaying 10 items.
- Liberating the dimension for \(L_2\)-approximation (Q423879) (← links)
- Can adaption help on the average? (Q760763) (← links)
- On adaption with noisy information (Q1113867) (← links)
- A note on varying cardinality in the average case setting (Q1330147) (← links)
- Information of varying cardinality (Q1821084) (← links)
- Complexity of approximating Hölder classes from information with varying Gaussian noise (Q2192676) (← links)
- Embeddings for infinite-dimensional integration and \(L_2\)-approximation with increasing smoothness (Q2274409) (← links)
- Worst case complexity of problems with random information noise (Q2365416) (← links)
- The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting (Q2365845) (← links)
- On the minimal cost of approximating linear problems based on information with deterministic noise (Q3474221) (← links)
