research
∙
07/24/2023
Fast in-place accumulated bilinear formulae
Bilinear operations are ubiquitous in computer science and in particular...
share
research
∙
02/27/2023
In-place fast polynomial modular remainder
We consider the fast in-place computation of the Euclidean polynomial mo...
research
∙
02/24/2022
Random primes without primality testing
Numerous algorithms call for computation over the integers modulo a rand...
research
∙
02/16/2022
Sparse Polynomial Interpolation and Division in Soft-linear Time
Given a way to evaluate an unknown polynomial with integer coefficients,...
research
∙
02/12/2022
Random primes in arithmetic progressions
We describe a straightforward method to generate a random prime q such t...
research
∙
02/09/2021
On exact division and divisibility testing for sparse polynomials
No polynomial-time algorithm is known to test whether a sparse polynomia...
research
∙
01/06/2021
Polynomial modular product verification and its implications
Polynomial multiplication is known to have quasi-linear complexity in bo...
research
∙
02/24/2020
Fast In-place Algorithms for Polynomial Operations: Division, Evaluation, Interpolation
We consider space-saving versions of several important operations on uni...
research
∙
01/31/2020
Essentially Optimal Sparse Polynomial Multiplication
We present a probabilistic algorithm to compute the product of two univa...
research
∙
02/08/2019
