The inverse of an automorphism in polynomial time

Authors:
Matthew Dickerson
Affiliations:
Dept of Mathematics and Computer Science Middlebury College, Middlebury VT 05753 USA
Venue:
Journal of Symbolic Computation
Year:
1992

Citing 4
Cited 0

Factoring sparse multivariate polynomials

Journal of Computer and System Sciences
A deterministic algorithm for sparse multivariate polynomial interpolation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Polynomial decomposition algorithms

Journal of Symbolic Computation
Factoring sparse multivariate polynomials

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.