The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic (Q3688114)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic |
scientific article |
Statements
The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic (English)
0 references
1985
0 references
epsilon optimality
0 references
complexity of discrete Tchebycheff approximation
0 references
greedy algorithm
0 references
\(l_ p\) norm
0 references
