On the ring isomorphism & automorphism problems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 2-12

  Kayal, Neeraj ^a   Saxena, Nitin ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

AUTOMORPHISM; FINITE RINGS; INTEGER FACTORIZATION; ISOMORPHISM;

COMPUTATIONAL COMPLEXITY;

EID: 27644433146     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. th IEEE Conference on Computational Complexity, 2004.
2. th IEEE Foundations of Computer Science, 1984, 229-240.
3. th International Workshop on Randomization and Approximation Techniques, 2002, 209-223.
4. [Len04] Hendrik Lenstra, Jr. Private communication. 2004.
5. [LN86] R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, 1986.
6. th ACM Symposium on Theory of Computing, 1976, 23-29.
7. [Mil76] G. L. Miller. Riemann's hypothesis and tests for primality. Journal of Computer and System Science. 13, 1976, 300-317.
8. [McD74] Bernard R. McDonald. Finite Rings with Identity. Marcel Dekker, Inc., 1974.
9. [Sch88] U. Schoning, Graph isomorphism is in the low hierarchy. Journal of Computer and System Science, 37, 1988, 312-323.