2000 character limit reached
Character Sums and Deterministic Polynomial Root Finding in Finite Fields
Published 22 Aug 2013 in math.NT and cs.CC | (1308.4803v2)
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
