On isomorphism testing of a class of 2-Nilpotent groups
Abstract
A polynomial time isomorphism test for a class of groups, properly containing the class of abelian groups, given either by multiplication tables or by generators and relators, is described. It is also shown that graph isomorphism testing is uniformly reducible to a word problem of a finitely presented group. © 1991.
Publication Title
Journal of Computer and System Sciences
Recommended Citation
Garzon, M., & Zalcstein, Y. (1991). On isomorphism testing of a class of 2-Nilpotent groups. Journal of Computer and System Sciences, 42 (2), 237-248. https://doi.org/10.1016/0022-0000(91)90012-T
COinS
