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 the normal view instead:
scientific article; zbMATH DE number 4147515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on probabilistically verifying integer and polynomial products |
scientific article; zbMATH DE number 4147515 |
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
0.7875364422798157
0 references
0.78718501329422
0 references
0.7826082706451416
0 references
0.749378502368927
0 references
