On the parallel evaluation of multivariate polynomials

DOI10.1145/800133.804347MaRDI QIDQ5402557zbMATH OpenOpenAlexFDO

Authors Laurent Hyafil

Publication date 14 March 2014

Published in Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800133.804347

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3890599
• On parallel evaluation of certain classes of polynomials with an increasing number of variables
• A Simple Parallel Algorithm for Polynomial Evaluation
• Improved Parallel Polynomial Division
• A Fast Parallel Horner Algorithm

Cited in

(12)

• Negation can be exponentially powerful
• Massively parallel computations on many-variable polynomials
• Computing polynomials with few multiplications
• BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
• scientific article; zbMATH DE number 3890599 (Why is no real title available?)
• scientific article; zbMATH DE number 3858283 (Why is no real title available?)
• scientific article; zbMATH DE number 1254017 (Why is no real title available?)
• A unified approach to evaluation algorithms for multivariate polynomials
• Parallel Multivariate Meta-Theorems
• Efficient evaluation of large polynomials
• The actual complexity of parallel evaluation of low degree polynomials
• On parallel evaluation of certain classes of polynomials with an increasing number of variables

This page was built for publication: On the parallel evaluation of multivariate polynomials

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