The bit-complexity of arithmetic algorithms (Q3928236): 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(81)90016-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076815935 / rank | |||
Normal rank | |||
Latest revision as of 10:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bit-complexity of arithmetic algorithms |
scientific article |
Statements
The bit-complexity of arithmetic algorithms (English)
0 references
1981
0 references
time-complexity
0 references
space-complexity
0 references
discrete Fourier transform
0 references
polynomial multiplication
0 references
arithmetic complexity
0 references
