Algorithm for studying polynomial maps and reductions modulo prime number (Q2117423): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jsc.2021.12.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JSC.2021.12.001 / rank | |||
Normal rank | |||
Latest revision as of 03:05, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm for studying polynomial maps and reductions modulo prime number |
scientific article |
Statements
Algorithm for studying polynomial maps and reductions modulo prime number (English)
0 references
21 March 2022
0 references
The authors studies the polynomial maps over \(\mathbb Q\). They gave an algorithm to find an inverse of a given polynomial automorphism with integer coefficient from a finite set of inverses of its reductions modulo prime numbers. In addition, they estimated the computational complexity and gave some examples.
0 references
polynomial automorphism
0 references
Jacobian problem
0 references
