A note on probabilistically verifying integer and polynomial products (Q3477964)
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: A note on probabilistically verifying integer and polynomial products |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on probabilistically verifying integer and polynomial products |
scientific article |
Statements
A note on probabilistically verifying integer and polynomial products (English)
0 references
1989
0 references
polynomial multiplication
0 references
probabilistic algorithms
0 references
cyclotomic
0 references
polynomials
0 references
complexity
0 references
