The Mixed Binary Euclid Algorithm (Q2840536): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.11.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986372353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parallel algorithm for integer GCD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modular reduction for GCD computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel extended GCD algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Fast GCD Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel implementation of the accelerated integer GCD algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:18, 6 July 2024

scientific article
Language Label Description Also known as
English
The Mixed Binary Euclid Algorithm
scientific article

    Statements

    The Mixed Binary Euclid Algorithm (English)
    0 references
    19 July 2013
    0 references
    greatest common divisor (GCD)
    0 references
    parallel complexity
    0 references
    algorithms
    0 references
    Euclidean algorithm
    0 references
    binary GCD algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references