Lower bounds for arithmetic networks (Q1803554)
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 arithmetic networks |
scientific article; zbMATH DE number 221180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for arithmetic networks |
scientific article; zbMATH DE number 221180 |
Statements
Lower bounds for arithmetic networks (English)
0 references
29 June 1993
0 references
parallel complexity
0 references
algebraic complexity theory
0 references
semialgebraic sets
0 references
lower bounds for depth of arithmetic networks
0 references
degree
0 references
connected components
0 references
parallel time
0 references
Knapsack problem
0 references
quantifier elimination
0 references
0 references
0.8066419363021851
0 references
0.8066419363021851
0 references
0.7841667532920837
0 references
