Resultats globals: 1 registres trobats en 0.01 segons.
Articles, 1 registres trobats
Articles 1 registres trobats  
1.
9 p, 279.3 KB Evaluation of polynomials over finite rings via additive combinatorics / Károlyi, Gyula (Eötvös University. Alfréd Rényi Institute of Mathematics) ; Szabó, Csaba (Eötvös University. Institute of Mathematics)
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.
2022 - 10.5565/PUBLMAT6612208
Publicacions matemàtiques, Vol. 66 Núm. 1 (2022) , p. 197-205 (Articles)  

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.