On isomorphism testing of a class of 2-nilpotent groups

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

Yechezkel Zalcstein, Max H. Garzon

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0022-0000(91)90012-t

zbMATH Keywords

relationsgeneratorsword problemnilpotent groupsfinitely presented groupisomorphism problempermutation propertygraph isomorphism testingfinite \(P_ 3\)-groupspolynomial time isomorphism test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Finite nilpotent groups, (p)-groups (20D15)

Related Items (5)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ Linear time algorithms for Abelian group isomorphism and related problems ⋮ The module isomorphism problem reconsidered. ⋮ Linear and sublinear time algorithms for the basis of abelian groups ⋮ Nearly linear time isomorphism algorithms for some nonabelian group classes

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On isomorphism testing of a class of 2-nilpotent groups