Parallel multiplication and powering of polynomials (Q808710): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computation of Powers of Sparse Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting X + Y / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Algorithms for Powering Sparse Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Discrete Fourier Transform / rank
 
Normal rank

Latest revision as of 09:36, 24 June 2024

scientific article
Language Label Description Also known as
English
Parallel multiplication and powering of polynomials
scientific article

    Statements

    Parallel multiplication and powering of polynomials (English)
    0 references
    0 references
    1991
    0 references
    0 references
    shared-memory multiprocessing
    0 references
    parallel algorithms
    0 references
    sparse polynomials
    0 references
    dense polynomials
    0 references
    algebraic manipulation
    0 references