arXiv · 1308.4803
Character Sums and Deterministic Polynomial Root Finding in Finite Fields
Abstract
We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.
Explore related subjects
Keep this discovery
Jean Bourgain, Sergei Konyagin, Igor Shparlinski. 2013-08-22. Character Sums and Deterministic Polynomial Root Finding in Finite Fields. https://arxiv.org/abs/1308.4803
Cite the original work for its findings. Save a collection to share your selection of sources.