visitante ::
identificación
|
|||||||||||||||
Buscar | Enviar | Ayuda | Servicio de Bibliotecas | Sobre el DDD | Català English Español |
Página principal > Artículos > Artículos publicados > Evaluation of polynomials over finite rings via additive combinatorics |
Fecha: | 2022 |
Resumen: | 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. |
Derechos: | Tots els drets reservats. |
Lengua: | Anglès |
Documento: | Article ; recerca ; Versió publicada |
Materia: | Additive combinatorics ; Chevalley's theorem ; Dichotomy ; Nilpotent rings ; Olson's theorem ; Polynomial method ; Equation solvability problem |
Publicado en: | Publicacions matemàtiques, Vol. 66 Núm. 1 (2022) , p. 197-205 (Articles) , ISSN 2014-4350 |
9 p, 279.3 KB |