Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715)
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 bounds for the non-linear complexity of algebraic computation trees with integer inputs |
scientific article; zbMATH DE number 423597
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs |
scientific article; zbMATH DE number 423597 |
Statements
Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (English)
0 references
10 October 1993
0 references
nonlinear complexity
0 references
real algebraic geometry
0 references
lower bounds
0 references
computation tree
0 references
