On the additive complexity of polynomials (Q1157163): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q126352409, #quickstatements; #temporary_batch_1719269348057
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3280357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Additions to Compute Specific Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for polynomials with algebraic coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of polynomials with super-preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Computation of Linear Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials with Rational Coefficients Which are Hard to Compute / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of multiplications necessary to compute certain functions / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126352409 / rank
 
Normal rank

Latest revision as of 23:50, 24 June 2024

scientific article
Language Label Description Also known as
English
On the additive complexity of polynomials
scientific article

    Statements

    Identifiers