\((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303): 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.1006/jsco.2000.0422 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965555407 / rank | |||
Normal rank | |||
Revision as of 23:44, 19 March 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
