The complexity of monotone computations of polynomials (Q1109563)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4070301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of monotone computations of polynomials |
scientific article; zbMATH DE number 4070301 |
Statements
The complexity of monotone computations of polynomials (English)
0 references
1987
0 references
See the review in Zbl 0641.68057.
0 references
complexity of computation
0 references
semi-group
0 references
semi-ring
0 references
monotone polynomials
0 references
sparse sets
0 references
