Bilinear operations are ubiquitous in computer science and in particular...
We consider the fast in-place computation of the Euclidean polynomial mo...
Numerous algorithms call for computation over the integers modulo a
rand...
Given a way to evaluate an unknown polynomial with integer coefficients,...
We describe a straightforward method to generate a random prime q such t...
No polynomial-time algorithm is known to test whether a sparse polynomia...
Polynomial multiplication is known to have quasi-linear complexity in bo...
We consider space-saving versions of several important operations on
uni...
We present a probabilistic algorithm to compute the product of two univa...
The polynomial multiplication problem has attracted considerable attenti...