Resumen de Evaluation of polynomials over finite rings via additive combinatorics

Gyula Károlyi, Csaba Szabó

• 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, whichmay be of independent interest.