Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Matrix multiplication via arithmetic progressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound for the integer element distinctness problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Betti Numbers of Real Varieties / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to multiply matrices faster / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds for algebraic decision trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01200063 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023899121 / rank | |||
Normal rank | |||
Latest revision as of 08: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
