Efficient Generic Quotients Using Exact Arithmetic (Q6081979): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Lower Bounds for Multiplication via Network Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast in-place algorithms for polynomial operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer multiplication in time \(O(n\log n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer division in residue number systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank

Revision as of 10:53, 3 August 2024

scientific article; zbMATH DE number 7760800
Language Label Description Also known as
English
Efficient Generic Quotients Using Exact Arithmetic
scientific article; zbMATH DE number 7760800

    Statements

    Efficient Generic Quotients Using Exact Arithmetic (English)
    0 references
    0 references
    3 November 2023
    0 references
    generic algorithms
    0 references
    Integer arithmetic
    0 references
    library structure
    0 references
    modified Newton iteration
    0 references
    polynomial arithmetic
    0 references
    quotient
    0 references
    remainder
    0 references

    Identifiers