On the additive complexity of polynomials

DOI10.1016/0304-3975(80)90068-7MaRDI QIDQ1157163zbMATH OpenOpenAlexWikidataFDO

Authors Claus Peter Schnorr, J. P. Van de Wiele

Publication date 1980

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(80)90068-7

zbMATH Keywords

arithmetic complexityevaluation of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3162280 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• An Algorithm for the Computation of Linear Forms
• Evaluation of polynomials with super-preconditioning
• Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
• Lower bounds for polynomials with algebraic coefficients
• On the Number of Additions to Compute Specific Polynomials
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• On the number of multiplications necessary to compute certain functions
• Polynomials with Rational Coefficients Which are Hard to Compute

Cited in

(5)

• On the representation of rational functions of bounded complexity
• Lower bounds in algebraic computational complexity
• Lower bounds for polynomials with algebraic coefficients
• Computability of the additive complexity of algebraic circuits with root extracting
• Lower bounds for the complexity of polynomials

This page was built for publication: On the additive complexity of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157163)