The actual complexity of parallel evaluation of low degree polynomials

DOI10.1016/0167-8191(90)90120-XzbMATH Open0691.65004MaRDI QIDQ582800FDOQ582800

Authors: Ronald J. Leach, O. Michael Atogi, Razeyah R. Stephen 

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Recommendations

• Sequential and parallel complexity of approximate evaluation of polynomial zeros
• scientific article; zbMATH DE number 515222
• A Simple Parallel Algorithm for Polynomial Evaluation
• On the parallel evaluation of multivariate polynomials
• The parallel complexity of exponentiating polynomials over finite fields
• Stability of parallel algorithms for polynomial evaluation
• On parallel evaluation of certain classes of polynomials with an increasing number of variables
• scientific article; zbMATH DE number 54587
• The parallel complexity of function approximation
• Parallel complexity of algebraic operations

zbMATH Keywords

complexity theoryparallel algorithmscomputer graphicsevaluation of polynomials

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Data-movement-intensive problems: Two folk theorems in parallel computation revisited
• Polynomial evaluation on superscalar architecture, applied to the elementary function \(e^x\)

This page was built for publication: The actual complexity of parallel evaluation of low degree polynomials

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