A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials (Q4907594)
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 6134393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.801308274269104
0 references
0.7902938723564148
0 references
0.7878100872039795
0 references
0.7766392827033997
0 references
