Dense polynomial multiplication with reduced array manipulation overhead (Q1204791)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dense polynomial multiplication with reduced array manipulation overhead |
scientific article |
Statements
Dense polynomial multiplication with reduced array manipulation overhead (English)
0 references
29 March 1993
0 references
The author presents an efficient algorithm for dense polynomial multiplication with reduced array manipulation overhead. Classical and proposed algorithms are compared. Complexity of the individual steps and the global one are studied. The difference in complexity and the execution time of the algorithms show that the proposed algorithm is the best.
0 references
algorithm
0 references
polynomial multiplication
0 references
reduced array manipulation
0 references
Complexity
0 references
