\((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CALYPSO / rank | |||
Normal rank | |||
Revision as of 11:29, 29 February 2024
scientific article; zbMATH DE number 1570912
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. |
scientific article; zbMATH DE number 1570912 |
Statements
\((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (English)
0 references
2000
0 references
