Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715): Difference between revisions
From MaRDI portal
Latest revision as of 09:25, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs |
scientific article |
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