The bit-complexity of arithmetic algorithms (Q3928236)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3742610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bit-complexity of arithmetic algorithms |
scientific article; zbMATH DE number 3742610 |
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
