On isomorphism testing of a class of 2-nilpotent groups

DOI10.1016/0022-0000(91)90012-TzbMath0749.20018MaRDI QIDQ1174452

Yechezkel Zalcstein, Max H. Garzon

Publication date: 25 June 1992

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

relations; generators; word problem; nilpotent groups; finitely presented group; isomorphism problem; permutation property; graph isomorphism testing; finite \(P_ 3\)-groups; polynomial time isomorphism test

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

20F05: Generators, relations, and presentations of groups

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

20D15: Finite nilpotent groups, (p)-groups

Related Items

Linear and sublinear time algorithms for the basis of abelian groups, Linear time algorithms for Abelian group isomorphism and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Burnside problem for semigroups
• Rational languages and the Burnside problem
• On permutation properties in groups and semigroups
• The occurrence of finite groups in the automorphism group of nilpotent groups of class 2
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Endliche Gruppen I