Knuth–Eve algorithm: Difference between revisions

Revision as of 18:52, 31 July 2025

Revision as of 18:52, 31 July 2025

Line 1:

{{Short description|Algorithm for evaluating polynomials}}

{{Draft topics|computing}}

{{AfC topic|stem}}

{{AfC submission|||ts=20250731005752|u=Ammrat13|ns=118}}

{{AFC submission|d|reason|Awaiting additional information. Please address the cn tags.|u=Ammrat13|ns=118|decliner=Caleb Stanford|declinets=20250730220006|ts=20250727062925}} <!-- Do not remove this line! -->

{{AFC comment|1=Please disregard previous question, see [[Draft talk:Knuth–Eve algorithm|talk page discussion]] instead. Once this and the cn tags are addressed we can resubmit. Thanks! [[User:Caleb Stanford|Caleb Stanford]] ([[User talk:Caleb Stanford|talk]]) 22:25, 30 July 2025 (UTC)}}

{{AFC comment|1={{Question}} Where did you find that the author is James? It's [https://link.springer.com/article/10.1007/BF01386049 not in the source article] which you linked. [[User:Caleb Stanford|Caleb Stanford]] ([[User talk:Caleb Stanford|talk]]) 21:57, 30 July 2025 (UTC)}}

{{AFC comment|1=Likely notable, but do we know who "J. Eve" is? It isn't mentioned in the lead or body, and it should be covered. Please also add more inline citations to all uncited content. There are no citations in the "Preprocessing step" section for example. [[User:Caleb Stanford|Caleb Stanford]] ([[User talk:Caleb Stanford|talk]]) 16:21, 29 July 2025 (UTC)}}

----

<!-- Important, do not remove anything above this line before article has been created. -->

In [[computer science]], the '''Knuth–Eve algorithm''' is an [[algorithm]] for [[polynomial evaluation]]. It [[Polynomial evaluation#Evaluation with preprocessing|preprocesses]] the coefficients of the polynomial to reduce the number of multiplications required at [[Execution (computing)#Runtime|runtime]].

Line 141 ⟶ 125:

<ref name="muller2016">{{cite book |last1=Muller |first1=Jean-Michel |title=Elementary functions: Algorithms and implementation |date=17 November 2016 |publisher=Birkh&auml;user Boston |___location=Boston, MA |isbn=978-1-4899-7983-4 |doi=10.1007/978-1-4899-7983-4_5 |pages=82–84 |url=https://link.springer.com/chapter/10.1007/978-1-4899-7983-4_5 |access-date=25 July 2025}}</ref>

}}

[[Category:Algorithms]]

[[Category:Polynomials]]

[[Category:Algorithms and data structures]]