A note on probabilistically verifying integer and polynomial products (Q3477964): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/58562.214082 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1985008110 / rank | |||
Normal rank |
Latest revision as of 02:31, 20 March 2024
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