Worst case complexity of problems with random information noise
From MaRDI portal
Publication:2365416
Recommendations
Cited in
(19)- Average case L_-approximation in the presence of Gaussian noise
- The complexity of indefinite elliptic problems with noisy data
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
- Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
- Average complexity for linear problems in a model with varying information noise
- Complexity of approximating Hölder classes from information with varying Gaussian noise
- How to benefit from noise
- On the optimal robust solution of IVPs with noisy information
- On average case complexity of linear problems with noisy information
- Noisy information: optimality, complexity, tractability
- Improvements of Winograd's result on computation in the presence of noise (Corresp.)
- Complexity of linear ill-posed problems in Hilbert space
- Noisy Information and Computational Complexity
- The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
- The worst case complexity of the fredholm equation with periodic free term and noisy information∗
- Complexity of neural network approximation with limited information: A worst case approach
- Worst case tractability of linear problems in the presence of noise: linear information
- The complexity of Fredholm equations of the second kind: noisy information about everything
- Randomized complexity of mean computation and the adaption problem
This page was built for publication: Worst case complexity of problems with random information noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365416)
