A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials (Q4907594): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1675518 |
||
| Property / author | |||
| Property / author: Igor S. Sergeev / rank | |||
Revision as of 03:48, 29 February 2024
scientific article; zbMATH DE number 6134393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials |
scientific article; zbMATH DE number 6134393 |
Statements
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials (English)
0 references
4 February 2013
0 references
complexity classes
0 references
lower bounds for complexity
0 references
arithmetic circuits
0 references
thin sets
0 references
monotone complexity
0 references
permanent
0 references
