Linearity of algorithms and a result of Ando

DOI10.1016/0885-064X(91)90007-KzbMath0739.68047OpenAlexW2094320607MaRDI QIDQ1179033

Mark A. Kon, Roberto Tempo

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(91)90007-k

zbMATH Keywords

information-based complexityalmost strongly optimal algorithms on \(L^ p\) spaces

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Normed linear spaces and Banach spaces; Banach lattices (46B99) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (2)

Worst-case analysis of the least-squares method and related identification methods ⋮ Linear algorithms with finite deviation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Are linear algorithms always good for linear problems?
• Linear problems (with extended range) have linear optimal algorithms
• On linearity of spline algorithms
• Contractive projections in \(L_ p\)-spaces
• Do Linear Problems Have Linear Optimal Algorithms?
• Recent developments in information-based complexity

This page was built for publication: Linearity of algorithms and a result of Ando