Optimal Algorithms for Parallel Polynomial Evaluation

@article{Munro1973OptimalAF,
  title={Optimal Algorithms for Parallel Polynomial Evaluation},
  author={J. Ian Munro and Mike Paterson},
  journal={J. Comput. Syst. Sci.},
  year={1973},
  volume={7},
  pages={189-198}
}
  • J. Ian Munro, Mike Paterson
  • Published in J. Comput. Syst. Sci. 1973
  • Mathematics, Computer Science
  • Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[log"2k], an algorithm given is within one time unit of optimality. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Tables and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 54 CITATIONS

    On the Parallel Evaluation of Certain Arithmetic Expressions

    VIEW 5 EXCERPTS
    CITES BACKGROUND & RESULTS
    HIGHLY INFLUENCED

    Parallel Solution of Recurrence Problems

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    On the Parallel Evaluation 0

    VIEW 3 EXCERPTS
    HIGHLY INFLUENCED

    New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Analysis of Pollard's Rho Factoring Method

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    Fast solver for Toeplitz bidiagonal systems of linear equations

    • Lublin-Polonia Sectio
    • 2018
    VIEW 1 EXCERPT
    CITES BACKGROUND

    New Approaches for Efficient Fully Homomorphic Encryption

    VIEW 1 EXCERPT
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    1972
    2019

    CITATION STATISTICS

    • 4 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES

    Exposure and Exploitation in Programs,

    • Y. MVRAOKA, Parallelism
    • Report No. 424,
    • 1971
    VIEW 2 EXCERPTS

    Homer's Rule is Uniquely Optimal,

    • A. BORODIN
    • Proceedings International Symposium on the Theory of Machines and Computation, Haifa, August,
    • 1971
    VIEW 1 EXCERPT

    Parallel Methods and Bounds of Evaluating Polynomials,

    • K. MARUYAMA
    • Report No. 427,
    • 1971
    VIEW 1 EXCERPT

    KNUTH, "The Art of Computer Programming: II

    • D E.
    • Seminumerical Algorithms,"
    • 1969
    VIEW 1 EXCERPT

    DORN, "Generalizations of Homer's Rule for Polynomial Evaluation,

    • W S.
    • IBM J. Res. Dev
    • 1962
    VIEW 1 EXCERPT

    BELAGA, "On Computing Polynomials in One Variable with Initial Conditioning of the Coefficients," Problemy Kibernet

    • E G.
    • 1961
    VIEW 1 EXCERPT

    Organization of computer systems: the fixed plus variable structure computer

    VIEW 1 EXCERPT

    MOTZKIN, "Evaluation of Polynomials and Evaluation of Rational Functions,

    • T S.
    • Bull. Amer. Math. Soc
    • 1955
    VIEW 1 EXCERPT