Selection of good algorithms from a family of algorithms for polynomial derivative evaluation (Q1248372): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(77)90010-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066183341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound on the complexity of derivative evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184360 / 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: Error Analysis of the Algorithm for Shifting the Zeros of a Polynomial by Synthetic Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding Error Analysis for the Evaluation of a Polynomial and Some of Its Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast stable in-place sorting with \(O(n)\) data moves / rank
 
Normal rank

Latest revision as of 23:57, 12 June 2024

scientific article
Language Label Description Also known as
English
Selection of good algorithms from a family of algorithms for polynomial derivative evaluation
scientific article

    Statements