The inverse of an automorphism in polynomial time

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Dickerson, M. (1992). The inverse of an automorphism in polynomial time. Journal of Symbolic Computation, 13(2), 209–220. https://doi.org/10.1016/S0747-7171(08)80090-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free