Lower complexity bounds for interpolation algorithms (Q2431336)
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: Lower complexity bounds for interpolation algorithms |
scientific article; zbMATH DE number 5877533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower complexity bounds for interpolation algorithms |
scientific article; zbMATH DE number 5877533 |
Statements
Lower complexity bounds for interpolation algorithms (English)
0 references
13 April 2011
0 references
Hermite-Lagrange interpolation
0 references
algorithm
0 references
lower complexity bound
0 references
constructible map
0 references
geometrically robust map
0 references
valuation
0 references
0 references
0.9068299
0 references
0.89565194
0 references
0.8946206
0 references
0.8865109
0 references
0 references
0.88000613
0 references
