In this paper we present a polynomial time algorithm for computing the inverse of an automorphism over a polynomial ring K[x]. The algorithm works over any commutative ring K, and in the case when K is a field, provides an exponential time solution to the problem of determining when an endomorphism is invertible. © 1991, Academic Press Limited. All rights reserved.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below