Faster multi-point evaluation over any field

The evaluation of a polynomial at several points is called the problem ofmulti-point evaluation. We design slightly new faster deterministic algorithmsto solve this problem for an algebraic computational model. For this purpose,we analyze the precomputation costs of recent amortized evaluation algor...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applicable algebra in engineering, communication and computing
Hlavní autoři: van der Hoeven, Joris, Lecerf, Grégoire
Médium: Journal Article
Jazyk:angličtina
Vydáno: Springer Verlag 14.08.2025
Témata:
Computer Science
complexity
polynomial multi-point evaluation algorithm complexity
polynomial
multi-point evaluation
algorithm
ISSN:0938-1279, 1432-0622
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The evaluation of a polynomial at several points is called the problem ofmulti-point evaluation. We design slightly new faster deterministic algorithmsto solve this problem for an algebraic computational model. For this purpose,we analyze the precomputation costs of recent amortized evaluation algorithms,and then study the complexity of the problem as a function of the number ofevaluation points.
ISSN:0938-1279
1432-0622
DOI:10.1007/s00200-025-00704-7