A probabilistic algorithm for verifying polynomial middle product in linear time (Q1799565)
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 probabilistic algorithm for verifying polynomial middle product in linear time |
scientific article; zbMATH DE number 6958540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A probabilistic algorithm for verifying polynomial middle product in linear time |
scientific article; zbMATH DE number 6958540 |
Statements
A probabilistic algorithm for verifying polynomial middle product in linear time (English)
0 references
19 October 2018
0 references
probabilistic algorithm
0 references
design of algorithm
0 references
computation on polynomials
0 references
polynomial multiplication
0 references
0 references
0 references
0.7826082706451416
0 references
0.7438899278640747
0 references
0.733315646648407
0 references
0.7218672633171082
0 references
0.7207767963409424
0 references
