scholar.google.com › citations
In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials f and g in time that is proportional to the size of the input plus the size of the output. The polynomials are given via lists of their coefficients F and G, respectively.
Jan 27, 2019
Using the Fast Fourier Transform, one can perform multiplication of polynomials stored as vectors of floating point numbers in time O(n log n), where n is a ...
Apr 20, 2020 · In this work we give a clean, nearly optimal algorithm for the sparse polynomial multiplication problem. ∗Saarland University and Max ...
This work gives a clean, nearly optimal algorithm for the sparse polynomial multiplication problem, which is particularly efficient when there are not “too ...
In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials $f$ and $g$ in time that is proportional to the size of the ...
Author: Nakos, Vasileios; Genre: Journal Article; Issued: 2020; Title: Nearly Optimal Sparse Polynomial Multiplication.
Jul 27, 2020 · We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit ...
People also ask
What is a sparse polynomial?
What is the fastest polynomial multiplication algorithm?
What is the complexity of polynomial multiplication?
How to multiply polynomials with two terms?
Aug 31, 2020 · We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations ...
Author: Nakos, Vasileios; Genre: Journal Article; Issued: 2020; Title: Nearly Optimal Sparse Polynomial Multiplication.
In mathematics, a sparse polynomial is a polynomial that has far fewer terms than its degree and number of variables would suggest.