On the Computational Complexity of Best L1-approximation

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200210)48:1+<66::AID-MALQ66>3.0.CO;2-Y" /><66::AID-MALQ66>3.0.CO;2-Y 10.1002/1521-3870(200210)48:1+<66::AID-MALQ66>3.0.CO;2-YzbMath1011.41014OpenAlexW1989619153MaRDI QIDQ4787858

Paulo Oliva

Publication date: 29 May 2003

Full work available at URL: https://doi.org/10.1002/1521-3870(200210)48:1+<66::aid-malq66>3.0.co;2-y

zbMATH Keywords

computable analysisstrong unicity\(L_1\) approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Functionals in proof theory (03F10)

Related Items (1)

Proof mining in \(L_{1}\)-approximation

This page was built for publication: On the Computational Complexity of Best L1-approximation