Evaluation of Polynomials over Finite Rings via Additive Combinatorics
classification
🧮 math.RA
keywords
additivecombinatoricsfinitepolynomialsringsboundcomplexitydepends
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.