Scholarlink

<p>The evaluation of a polynomial at several points is called the problem of multi-point evaluation. We design new faster deterministic algorithms to 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 of evaluation points.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Faster multi-point evaluation over any field

  • 期刊论文

  • 发表日期：

    2025年8月14日

查看全文
  • Joris van der Hoeven,
  • Grégoire Lecerf

摘要

The evaluation of a polynomial at several points is called the problem of multi-point evaluation. We design new faster deterministic algorithms to 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 of evaluation points.