Worst case complexity of problems with random information noise
From MaRDI portal
Publication:2365416
DOI10.1006/jcom.1996.0026zbMath0862.68061OpenAlexW2027813214MaRDI QIDQ2365416
Publication date: 26 May 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1996.0026
Related Items
Where does smoothness count the most for Fredholm equations of the second kind with noisy information? ⋮ The complexity of indefinite elliptic problems with noisy data ⋮ The complexity of Fredholm equations of the second kind: noisy information about everything ⋮ Worst case tractability of linear problems in the presence of noise: linear information ⋮ Complexity of approximating Hölder classes from information with varying Gaussian noise ⋮ 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 ⋮ Average case \(L_\infty\)-approximation in the presence of Gaussian noise ⋮ On the optimal robust solution of IVPs with noisy information
This page was built for publication: Worst case complexity of problems with random information noise
