The complexity of two problems on arithmetic circuits (Q2465637)
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: The complexity of two problems on arithmetic circuits |
scientific article; zbMATH DE number 5223680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of two problems on arithmetic circuits |
scientific article; zbMATH DE number 5223680 |
Statements
The complexity of two problems on arithmetic circuits (English)
0 references
7 January 2008
0 references
arithmetic circuits
0 references
polynomials
0 references
counting classes
0 references
algorithms
0 references
0 references
0.8364973068237305
0 references
0.8353868126869202
0 references
0.7912264466285706
0 references
0.7830126881599426
0 references
