\((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: (1+i)-ary GCD computation in Z[i] as an analogue to the binary GCD algorithm. |
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
0 references
