Deterministically testing sparse polynomial identities of unbounded degree (Q976069)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministically testing sparse polynomial identities of unbounded degree |
scientific article |
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
