How many polynomials can be approximated faster than they can be evaluated? (Q1155959)
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: How many polynomials can be approximated faster than they can be evaluated? |
scientific article; zbMATH DE number 3733260
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How many polynomials can be approximated faster than they can be evaluated? |
scientific article; zbMATH DE number 3733260 |
Statements
How many polynomials can be approximated faster than they can be evaluated? (English)
0 references
1981
0 references
algebraic complexity
0 references
canonical computation
0 references
universal fields
0 references
Zariski- closed sets
0 references
arithmetic complexity
0 references
evaluation of polynomials
0 references
approximation of polynomials
0 references
lower bounds on arithmetic complexity
0 references
Zariski-topology
0 references
