On isomorphism testing of a class of 2-Nilpotent groups
Journal of Computer and System Sciences
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Fast Monte Carlo algorithms for permutation groups
Selected papers of the 23rd annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Some new upper bounds on the generation of prime numbers
Communications of the ACM
On the nlog n isomorphism technique (A Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Solvable Group Isomorphism is (almost) in NP " CoNP
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Linear and Sublinear Time Algorithms for Basis of Abelian Groups
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Linear and sublinear time algorithms for the basis of abelian groups
Theoretical Computer Science
Linear time algorithms for the basis of abelian groups
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Code equivalence and group isomorphism
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Polynomial-time isomorphism test for groups with no abelian normal subgroups
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(nlogn) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(nlogn) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian.