An algorithm for polynomial multiplication that does not depend on the ring constants (Q3792774): 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.1016/0196-6774(88)90010-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012990935 / rank | |||
Normal rank | |||
Latest revision as of 18:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for polynomial multiplication that does not depend on the ring constants |
scientific article |
Statements
An algorithm for polynomial multiplication that does not depend on the ring constants (English)
0 references
1988
0 references
algorithm to multiply two polynomials
0 references
Chinese Remainder Theorem
0 references
