@article{1cde8393-aa9e-41fb-8e27-b4c65145dd4a,
author = {Paweł Bogdan},
title = {Complexity of the Inversion Algorithm of Polynomial Mappings},
journal = {Schedae Informaticae},
volume = {2016},
number = {Volume 25},
year = {2017},
issn = {1732-3916},
pages = {209-225},keywords = {polynomial automorphism; differential Galois theory; computational complexity; computer algebra system},
abstract = {In this paper we will recall the inversion algorithm described in [1]. The algorithm classifies polynomial automorphisms into two sets: Pascal finite and Pascal infinite. In this article the  complexity of the inversion algorithm will be estimated. To do so, we will present two popular ways  how Computer   lgebra Systems (CASes) keep the information about multivariate polynomials. We will define the complexity as the amount of simple operations performed by the algorithm as a function of the size of the input. We will define simple operations of the algorithm. Then we will estimate complexity of checking that the polynomial map is not a polynomial automorphism. To do so we will use theorem 3.1 from [1].},
doi = {10.4467/20838476SI.16.016.6197},
url = {https://ejournals.eu/en/journal/schedae-informaticae/article/complexity-of-the-inversion-algorithm-of-polynomial-mappings}
}