arXiv · 1809.06543
Evaluation of Polynomials over Finite Rings via Additive Combinatorics
Abstract
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics, which may be of independent interest.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gyula Károlyi, Csaba Szabó. 2018-09-18. Evaluation of Polynomials over Finite Rings via Additive Combinatorics. https://arxiv.org/abs/1809.06543
Cite the original work for its findings. Save a collection to share your selection of sources.