Complexity of linear problems with a fixed output basis
From MaRDI portal
Publication:1977152
DOI10.1006/jcom.1999.0538zbMath0951.68044OpenAlexW2056443473MaRDI QIDQ1977152
Erich Novak, Henryk Woźniakowski
Publication date: 9 May 2000
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1999.0538
Related Items (2)
Optimal approximation of elliptic problems by linear and nonlinear mappings. I ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. II
Cites Work
- s-numbers in information-based complexity
- Are linear algorithms always good for linear problems?
- On the topology of algorithms. I
- On the cost of uniform and nonuniform algorithms
- Why does information-based complexity use the real number model?
- The real number model in numerical analysis
- Topological complexity with continuous operations
- Topological complexity of zero-finding
- On the power of adaption
- Optimal sequential and non-sequential procedures for evaluating a functional
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the optimality of linear methods for operator approximation in convex classes of functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity of linear problems with a fixed output basis
