Fast Multivariate Multipoint Evaluation over All Finite Fields
Abstract
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 \(\mathbb {F}\) that outputs the evaluations of an m-variate polynomial of degree less than d in each variable at N points in time,for all \(m\in \mathbb {N}\) and all sufficiently large \(d\in \mathbb {N}\) .
\(\begin{equation*} (d^m+N)^{1+o(1)}\cdot {{\sf poly}}(m,d,\log |\mathbb {F}|), \end{equation*}\)
A previous work of Kedlaya and Umans (FOCS 2008 and 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 and 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. More specifically, our second algorithm solves the multivariate multipoint evaluation problem over a finite field \(\mathbb {F}\) in time,for all \(m\in \mathbb {N}\) and all sufficiently large \(d\in \mathbb {N}\) , provided that the size of the finite field \(\mathbb {F}\) is at most \((\exp (\exp (\exp (\cdots (\exp (d)))))\) , where the height of this tower of exponentials is fixed.
\(\begin{equation*} (d^m+N)^{1+o(1)}\cdot {{\sf poly}}(m,d,\log |\mathbb {F}|), \end{equation*}\)
References
[1]
Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, and Chandra Kanta Mohapatra. 2022. Fast, algebraic multivariate multipoint evaluation in small characteristic and applications. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC’22), Stefano Leonardi and Anupam Gupta (Eds.). ACM, 403–415.
[2]
Andreas Björklund, Petteri Kaski, and Ryan Williams. 2019. Generalized kakeya sets for polynomial evaluation and faster computation of fermionants. Algorithmica 81, 10 (2019), 4010–4028.
[3]
Enrico Bombieri. 1965. On the large sieve. Mathematika 12, 2 (1965), 201–225.
[4]
Allan Borodin and Robert Moenck. 1974. Fast modular transforms. J. Comput. Syst. Sci. 8, 3 (1974), 366–386.
[5]
Michael Forbes. 2014. Polynomial Identity Testing of Read-Once Oblivious Algebraic Branching Programs. Ph. D. Dissertation. Massachusetts Institute of Technology.
[6]
Stasys Jukna. 2011. Extremal Combinatorics: With Applications in Computer Science (2nd ed.). Springer.
[7]
Kiran Kedlaya. 2015. Lecture Notes for the Course ‘Analytic Number Theory’. Retrieved from https://kskedlaya.org/papers/ant-overall.pdf
[8]
Kiran Kedlaya and Christopher Umans. 2011. Fast polynomial factorization and modular composition. SIAM J. Comput. 40, 6 (2011), 1767–1802.
[9]
Serge Lang. 2002. Algebra (3rd ed.). Springer-Verlag, New York Inc.
[10]
J. Maynard. 2012. On the Brun-Titchmarsh theorem. arXiv:1201.1777. Retrieved from https://arxiv.org/abs/1201.1777
[11]
James Maynard. 2020. Primes in arithmetic progressions to large moduli I: Fixed residue classes. arXiv:2006.06572. Retrieved from https://arxiv.org/abs/2006.06572
[12]
Michael Nüsken and Martin Ziegler. 2004. Fast multipoint evaluation of bivariate polynomials. In Algorithms–ESA 2004, Susanne Albers and Tomasz Radzik (Eds.). Springer, Berlin, 544–555.
[13]
Victor Shoup. 2008. A Computational Introduction to Number Theory and Algebra (2nd ed.). Cambridge University Press, New York.
[14]
Carl Siegel. 1935. Über die classenzahl quadratischer zahlkörper. Acta Arith. 1, 1 (1935), 83–86.
[15]
Christopher Umans. 2008. Fast polynomial factorization and modular composition in small characteristic. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Cynthia Dwork (Ed.). ACM, 481–490.
[16]
Joris van Der Hoeven and Grégoire Lecerf. 2020. Fast multivariate multi-point evaluation revisited. J. Complex. 56 (2020), 101405.
[17]
Joris van Der Hoeven and Grégoire Lecerf. 2023. Amortized multi-point evaluation of multivariate polynomials. J. Complex. 74 (2023), 101693.
[18]
A. I. Vinogradov. 1965. The density hypothesis for the dirichlet L-series. Izvest. Rossiisk. Akad. Nauk. Ser. Mat. 29 (1965), 903–934.
[19]
Joachim von zur Gathen and Jürgen Gerhard. 2013. Modern Computer Algebra (3rd ed.). Cambridge University Press.
[20]
Arnold Walfisz. 1936. Zur additiven zahlentheorie. II. Math. Zeitschr. 40, 1 (1936), 592–607.
Index Terms
- Fast Multivariate Multipoint Evaluation over All Finite Fields
Recommendations
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field $\mathbb{F}[2]$. In this problem, we are given a set of points $\mathbf{x}\in\{0,1\}^n$ and target values $f(\mathbf{x})\in\{0,1\}$ for each of ...
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
We present a deterministic $2^{O(t)}q^{\frac{t-2}{t-1}+o(1)}$ algorithm to decide whether a univariate polynomial $f$, with $t$ monomial terms and degree $<q$, has a root in the finite field $\mathbb{F}_q$. Our method is the first with complexity sublinear ...
Comments
Information & Contributors
Information
Published In
June 2024
323 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/3613558
- Editor:
- Venkatesan Guruswami
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 June 2024
Online AM: 21 March 2024
Accepted: 02 February 2024
Revised: 24 December 2023
Received: 05 July 2023
Published in JACM Volume 71, Issue 3
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Department of Atomic Energy, Government of India
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 95Total Downloads
- Downloads (Last 12 months)95
- Downloads (Last 6 weeks)34
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in