Abstract

We observe that polynomial evaluation and interpolation can be performed fast over a multidimensional grid (lattice), and we apply this observation in order to devise a simple algorithm for multivariate polynomial multiplication. Surprisingly, this simple idea enables us to improve the known algorithms for multivariate polynomial multiplication based on the forward and backward application of Kronecker's map; in particular, we decrease, by the factor log log N, the known upper bound on the arithmetic time-complexity of this computation (over any field of constants), provided that the degree d in each of the m variables is fixed, m grows to the infinity, and N = ( d + 1) m .

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.