Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity (Q5368767)
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: Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity |
scientific article; zbMATH DE number 6789298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity |
scientific article; zbMATH DE number 6789298 |
Statements
10 October 2017
0 references
Boolean circuits
0 references
arithmetic circuits
0 references
lower bounds
0 references
functional computation
0 references
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity (English)
0 references
0.9318995
0 references
0.92664355
0 references
0 references
0.9220351
0 references
0.9171226
0 references
0.91144294
0 references
