On the Computational Complexity of Best L1-approximation (Q4787858)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Computational Complexity of Best L1-approximation |
scientific article; zbMATH DE number 1850716
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computational Complexity of Best L1-approximation |
scientific article; zbMATH DE number 1850716 |
Statements
29 May 2003
0 references
\(L_1\) approximation
0 references
strong unicity
0 references
computable analysis
0 references
On the Computational Complexity of Best L1-approximation (English)
0 references
