Fast Multivariate Multipoint Evaluation Over All Finite Fields

04/30/2022
by   Vishwas Bhargava, et al.
0

Multivariate multipoint evaluation is the problem of evaluating a multivariate polynomial, given as a coefficient vector, simultaneously at multiple evaluation points. In this work, we show that there exists a deterministic algorithm for multivariate multipoint evaluation over any finite field 𝔽 that outputs the evaluations of an m-variate polynomial of degree less than d in each variable at N points in time (d^m+N)^1+o(1)·(m,d,log|𝔽|) for all m∈ and all sufficiently large d∈ℕ. A previous work of Kedlaya and Umans (FOCS 2008, SICOMP 2011) achieved the same time complexity when the number of variables m is at most d^o(1) and had left the problem of removing this condition as an open problem. A recent work of Bhargava, Ghosh, Kumar and Mohapatra (STOC 2022) answered this question when the underlying field is not too large and has characteristic less than d^o(1). In this work, we remove this constraint on the number of variables over all finite fields, thereby answering the question of Kedlaya and Umans over all finite fields. Our algorithm relies on a non-trivial combination of ideas from three seemingly different previously known algorithms for multivariate multipoint evaluation, namely the algorithms of Kedlaya and Umans, that of Björklund, Kaski and Williams (IPEC 2017, Algorithmica 2019), and that of Bhargava, Ghosh, Kumar and Mohapatra, together with a result of Bombieri and Vinogradov from analytic number theory about the distribution of primes in an arithmetic progression. We also present a second algorithm for multivariate multipoint evaluation that is completely elementary and in particular, avoids the use of the Bombieri–Vinogradov Theorem. However, it requires a mild assumption that the field size is bounded by an exponential-tower in d of bounded height.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2021

Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications

Multipoint evaluation is the computational task of evaluating a polynomi...
research
04/03/2023

Fast Numerical Multivariate Multipoint Evaluation

We design nearly-linear time numerical algorithms for the problem of mul...
research
01/21/2020

Sparse Polynomial Interpolation Based on Derivative

In this paper, we propose two new interpolation algorithms for sparse mu...
research
05/10/2019

Effective Coefficient Asymptotics of Multivariate Rational Functions via Semi-Numerical Algorithms for Polynomial Systems

The coefficient sequences of multivariate rational functions appear in m...
research
04/16/2023

A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium

In this paper we introduce a multistep generalization of the guess-and-d...
research
02/20/2020

Even faster algorithms for CSAT over supernilpotent algebras

In this paper two algorithms solving circuit satisfiability problem over...
research
08/29/2023

Moments of the number of points in a bounded set for number field lattices

We examine the moments of the number of lattice points in a fixed ball o...

Please sign up or login with your details

Forgot password? Click here to reset