A modular integer GCD algorithm (Q4652409)
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 2136824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modular integer GCD algorithm |
scientific article; zbMATH DE number 2136824 |
Statements
A modular integer GCD algorithm (English)
0 references
22 February 2005
0 references
Integer GCD
0 references
Modular representation
0 references
Residue arithmetic
0 references
Parallel algorithm
0 references
0.9094396829605104
0 references
0.8821178078651428
0 references
0.8808140158653259
0 references
0.8711069822311401
0 references
0.8707312345504761
0 references
