Algorithm for studying polynomial maps and reductions modulo prime number (Q2117423)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7493807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm for studying polynomial maps and reductions modulo prime number |
scientific article; zbMATH DE number 7493807 |
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
0.8975811
0 references
0.8957195
0 references
0.8878399
0 references
0.88030666
0 references
0.87790835
0 references
0.87575483
0 references
0.87548095
0 references
0.87190866
0 references
