The black-box query complexity of polynomial summation (Q626615)
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 black-box query complexity of polynomial summation |
scientific article; zbMATH DE number 5853227
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The black-box query complexity of polynomial summation |
scientific article; zbMATH DE number 5853227 |
Statements
The black-box query complexity of polynomial summation (English)
0 references
18 February 2011
0 references
counting problems
0 references
polynomial summation
0 references
arithmetization
0 references
circuit complexity
0 references
0.8770535
0 references
0 references
0.8543525
0 references
0.85407597
0 references
0.8532133
0 references
