An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism

Journal of Computer and System Sciences

Volumn 53, Issue 1, 1996, Pages 1-9

  Vikas, Narayan ^a,b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; INVERSE PROBLEMS; MATHEMATICAL MORPHOLOGY; MATHEMATICAL OPERATORS; MEMBERSHIP FUNCTIONS; THEOREM PROVING;

ABELIAN GROUP ISOMORPHISM;

ALGORITHMS;

EID: 0030218678     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0045     Document Type: Article

References (9)

1. G. E. Andrews, "The Theory of Partitions," Encyclopedia of Mathematics and Its Applications, Vol. 2, Addison-Wesley, Reading, MA, 1976.
2. T. M. Apostol, "Introduction to Analytic Number Theory," Springer-Verlag, New York/Berlin, 1976.
3. M. Hall Jr., "Theory of Groups," Macmillan Co., New York, 1959.
4. G. H. Hardy and E. M. Wright, "An Introduction to the Theory of Numbers," 4th ed., Clarendon Press, Oxford, 1960.
5. I. N. Herstein, "Topics in Algebra," Blaisdell, New York, 1964.
6. S. MacLane and G. Birkhoff, "Algebra," Macmillan Co., New York, 1967.
7. log n isomorphism technique, in "Proceedings Tenth Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, May 1978."
8. H. Rademacher, On the partition function p(n), Proc. London Math. Soc. 43 (1937), 241-254.
9. 2) Algorithm for Abelian Group Isomorphism," Technical Report, TR 80-01, North Carolina State University, January 1980.