On the complexity of algorithms for the translation of polynomials (Q1133877): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Polynomials at Fixed Sets of Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on a new method for polynomial real root isolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forgotten theorem of Mr. Vincent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementare Darstellung der schnellen Fouriertransformation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02242791 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W413656932 / rank
 
Normal rank

Latest revision as of 10:45, 30 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of algorithms for the translation of polynomials
scientific article

    Statements

    On the complexity of algorithms for the translation of polynomials (English)
    0 references
    0 references
    1980
    0 references
    complexity of algorithms
    0 references
    coefficients of translated polynomials
    0 references
    Taylor expansion
    0 references
    Ruffini-Horner method
    0 references
    fast Fourier transform
    0 references

    Identifiers