Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme

Switch Atlas

Algorithm

Knuth-Eve Algorithm

Numerical Algorithm

In computer science, the Knuth-Eve algorithm is an algorithm for polynomial evaluation. It preprocesses the coefficients of the polynomial before runtime so that fewer multiplications are required when the polynomial is evaluated. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Connections

Credited To

Donald Knuth, Pioneers
Source Wikipedia: Knuth-Eve algorithm

In Field

Algorithms and Complexity Theory, Fields
Source Knuth-Eve algorithm (Wikipedia)

Invented By

Donald Knuth, Pioneers
Source Wikipedia: Knuth-Eve algorithm
Sources
Wikipedia: Knuth-Eve algorithm
  • Credited To: Donald Knuth, Intro, lead sentence
    Donald Knuth
  • Invented By: Donald Knuth, Intro, lead sentence
    Donald Knuth
View the Source
Knuth-Eve algorithm (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead sentence
Quote, In Field: Algorithms and Complexity Theory, Lead sentence
Knuth-Eve algorithm is an algorithm for polynomial evaluation.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.