\((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
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
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21--25, 1998. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3234138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of steps in the Euclidean algorithm over complex quadratic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclid's Algorithm for Large Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4721647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of divisions of the Euclidean algorithm applied to Gaussian integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: ISSAC '88, Proceedings of the International Symposium on Symbolic and Algebraic Computation. Rome, Italy, July 4--8, 1988. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest division chains in imaginary quadratic number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4306894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Fast GCD Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational problems associated with Racah algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accelerated integer GCD algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel implementation of the accelerated integer GCD algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739476 / rank
 
Normal rank

Latest revision as of 15:24, 3 June 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
    0 references
    2000
    0 references
    0 references
    0 references