Live briefing
Everything about Polynomial evaluation
Algorithms for polynomial evaluation
In mathematics and computer science, polynomial evaluation refers to computation of the value of a polynomial when its indeterminates are substituted for some values. In other words, evaluating the polynomial at consists of computing See also Polynomial ring § Polynomial evaluation Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Polynomial evaluationA 5-minute orientation
- Skim a recent paper: Publicly Verifiable Homomorphic Secret Sharing for Polynomial EvaluationInfluential work since 2022
- Pick up a classic book: Mathematical Methods in the Physical SciencesThe most-reprinted book on the subject
- Read the landmark paper: Oblivious Polynomial EvaluationCited 107 times
- Go sideways: Horner's methodA closely related topic
- Go sideways: Knuth–Eve algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Oblivious Polynomial Evaluation
Optimal algorithms for parallel polynomial evaluation
Generalizations of Horner's Rule for Polynomial Evaluation
Algorithms for accurate, validated and fast polynomial evaluation
Evaluation of the Tensor Polynomial Strength Theory for Wood
Standard uncertainty evaluation of multivariate polynomial
Evaluation of generalized polynomial function specification methods
On the Evaluation of Polynomial Coefficients
🆕 Influential since 2022
Publicly Verifiable Homomorphic Secret Sharing for Polynomial Evaluation
Factorization in additive monoids of evaluation polynomial semirings
Sketched and Truncated Polynomial Krylov Methods: Evaluation of Matrix Functions
Evaluation of moments of performance functions based on polynomial chaos expansions
Calibration and fast evaluation algorithms for homogeneous orthotropic polynomial yield functions
📚 Books worth reading
Mathematical Methods in the Physical SciencesMary L. Boas, Mary Layne Boas · 1966
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Bibliography of continental drift and plate tectonicsTina Kasbeer · 1972
Introduction to numerical analysis and scientific computingNabil Nassif · 2014
Fundamentals of data structures in CEllis Horowitz · 1993
Beginning algebra with applicationsRichard N. Aufmann, Vernon C. Barker · 2003
CBESTAllan Mundsack, Charlotte Doctor · 2004
Fundamentals of computer algorithmsEllis Horowitz · 1978
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Horner's method In mathematics and computer science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation. It is named after William George Horner…
- Knuth–Eve algorithm In computer science, the Knuth–Eve algorithm is an algorithm for polynomial evaluation. It preprocesses the coefficients of the polynomial to reduce the…
- Estrin's scheme In numerical analysis, Estrin's scheme (after Gerald Estrin), also known as Estrin's method, is an algorithm for numerical evaluation of polynomials. Horner's…
- Polynomial ring In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more…
- General number field sieve In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100. Heuristically…
- Vandermonde matrix In linear algebra, a Vandermonde matrix, named after Alexandre-Théophile Vandermonde, is a matrix with the terms of a geometric progression in each row:…
- Polynomial In mathematics, a polynomial is a mathematical expression consisting of indeterminates (also called variables) and coefficients, that involves only the…
- Exponentiation by squaring In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a number…