论文信息 - On Isomorphism Testing of a Class of 2-Nilpotent Groups - 字舞流文

On Isomorphism Testing of a Class of 2-Nilpotent Groups

Yechezkel Zalcstein | Max H. Garzon | M. Garzon | Y. Zalcstein

[1] B. Huppert. Endliche Gruppen I , 1967 .

[2] W. Magnus,et al. Combinatorial Group Theory: COMBINATORIAL GROUP THEORY , 1967 .

[3] H. Heineken,et al. The occurrence of finite groups in the automorphism group of nilpotent groups of class 2 , 1974 .

[4] R. Lyndon,et al. Combinatorial Group Theory , 1977 .

[5] Ravi Kannan,et al. Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[6] D. Robinson. A Course in the Theory of Groups , 1982 .

[7] Mario Curzio,et al. Su di un problema combinatorio in teoria dei gruppi , 1983 .

[8] C. Reutenauer,et al. On the burnside problem for semigroups , 1984 .

[9] Antonio Restivo,et al. Rational Languages and the Burnside Problem , 1985, Theor. Comput. Sci..

[10] Yechezkel Zalcstein,et al. The complexity of isomorphism testing , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[11] M. Garzon,et al. On permutation properties in groups and semigroups , 1986 .

[12] Yechezkel Zalcstein,et al. The Complexity of Grigorchuk Groups with Application to Cryptography , 1991, Theor. Comput. Sci..