Deterministically testing sparse polynomial identities of unbounded degree (Q976069)
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 5721969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministically testing sparse polynomial identities of unbounded degree |
scientific article; zbMATH DE number 5721969 |
Statements
Deterministically testing sparse polynomial identities of unbounded degree (English)
0 references
16 June 2010
0 references
theory of computation
0 references
polynomial identity testing
0 references
arithmetic circuits
0 references
derandomization
0 references
0 references
0 references
0 references
0 references
0.8277906179428101
0 references
0.8208237886428833
0 references
0.8187735676765442
0 references
0.8153006434440613
0 references
