The inverse of an automorphism in polynomial time

  • Dickerson M
  • 5


    Mendeley users who have this article in their library.
  • 3


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Matthew Dickerson

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free