Automorphisms of Finite Rings and Applications to Complexity of Problems

@inproceedings{Agrawal2005AutomorphismsOF,
  title={Automorphisms of Finite Rings and Applications to Complexity of Problems},
  author={Manindra Agrawal and Nitin Saxena},
  booktitle={STACS},
  year={2005}
}
In mathematics, automorphisms of algebraic structures play an important role. Automorphisms capture the symmetries inherent in the structures and many important results have been proved by analyzing the automorphism group of the structure. For example, Galois characterized degree five univariate polynomials f over rationals whose roots can be expressed using radicals (using addition, subtraction, multiplication, division and taking roots) via the structure of automorphism group of the splitting… CONTINUE READING

From This Paper

Topics from this paper.
11 Citations
26 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 26 references

In Proceedings of Annual ACM Symposium on the Theory of Computing

  • Arjan K. Lenstra, Hendrik W. Lenstra, M. S. Manasse, J. M. Pollard. The number field sieve
  • pages 564–572,
  • 1990
Highly Influential
5 Excerpts

Technical Report TR04-109

  • Neeraj Kayal, Nitin Saxena. On the ring isomorphism, automorphism problems
  • Electronic Colloquium on Computational Complexity…
  • 2004
Highly Influential
9 Excerpts

Annals of Mathematics

  • Manindra Agrawal, Neeraj Kayal, P NitinSaxena.PRIMESisin
  • 160:1–13,
  • 2004

PRIMES is in P

  • C. Pomerance L. M. Adleman, R. S. Rumely
  • Annals of Mathematics
  • 2004

Chicago Journal of Theoretical Computer Science

  • Thomas Thierauf. The isomorphism problem for read-once br programs, arithmetic circuits
  • 1998,
  • 1998
3 Excerpts

Similar Papers

Loading similar papers…