Noisy information: optimality, complexity, tractability
From MaRDI portal
Recommendations
- Worst case complexity of problems with random information noise
- Average complexity for linear problems in a model with varying information noise
- Average case complexity of linear multivariate problems. I: Theory
- On average case complexity of linear problems with noisy information
- On the minimal cost of approximating linear problems based on information with deterministic noise
Cited in
(16)- Noisy inference and oracles
- Universality and optimality in the information-disturbance tradeoff
- Average complexity for linear problems in a model with varying information noise
- Optimal approximation of stochastic integrals in analytic noise model
- Absolute value information for IBC problems
- Worst case complexity of problems with random information noise
- On the optimal robust solution of IVPs with noisy information
- Noisy Information and Computational Complexity
- scientific article; zbMATH DE number 7204267 (Why is no real title available?)
- Common Information, Noise Stability, and Their Extensions
- Information Acquisition Under Resource Limitations in a Noisy Environment
- Worst case tractability of linear problems in the presence of noise: linear information
- Euler scheme for approximation of solution of nonlinear ODEs under inexact information
- On the randomized Euler algorithm under inexact information
- Noisy information for linear problems in the asymptotic setting
- Approximation of piecewise Hölder functions from inexact information
This page was built for publication: Noisy information: optimality, complexity, tractability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926215)
