Károlyi, Gyula and Szabó, Csaba (2022) Evaluation of polynomials over finite rings via additive combinatorics. PUBLICACIONS MATEMATIQUES, 66 (1). pp. 197-205. ISSN 0214-1493
|
Text
1809.06543.pdf Download (136kB) | Preview |
Official URL: https://doi.org/10.5565/PUBLMAT6612208
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.
| Item Type: | Article |
|---|---|
| Additional Information: | Export Date: 15 June 2022 |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 04 Nov 2022 12:26 |
| Last Modified: | 04 Nov 2022 12:26 |
| URI: | http://real.mtak.hu/id/eprint/152906 |
Actions (login required)
 |
Edit Item |
