Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Fast GCD Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accelerated integer GCD algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximating \(k\)-ary GCD algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5772619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of Euclidean Algorithm and Rational Number Reconstruction / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3103/s1066369x17110044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2766246451 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:42, 30 July 2024

scientific article
Language Label Description Also known as
English
Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm
scientific article

    Statements

    Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (English)
    0 references
    0 references
    0 references
    0 references
    13 February 2018
    0 references
    Euclidean algorithm
    0 references
    extended Euclidean algorithm
    0 references
    \(k\)-ary GCD algorithm
    0 references
    calculation of inverse elements by module
    0 references

    Identifiers