论文信息 - Factoring Groups Efficiently

Factoring Groups Efficiently

We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G , the algorithm outputs two subgroups A and B of G such that G is the direct product of A and B , if such a decomposition exists.

Neeraj Kayal | Timur Nezhmetdinov | N. Kayal | Timur Nezhmetdinov

[1] Eugene M. Luks. Computing the composition factors of a permutation group in polynomial time , 1987, Comb..

[2] Telikepalli Kavitha. Linear time algorithms for Abelian group isomorphism and related problems , 2007, J. Comput. Syst. Sci..

[3] William M. Kantor,et al. Polynomial-Time Versions of Sylow's Theorem , 1988, J. Algorithms.

[4] I. Herstein,et al. Topics in algebra , 1964 .

[5] François Le Gall,et al. Efficient Isomorphism Testing for a Class of Group Extensions , 2008, STACS.

[6] William M. Kantor. Finding Sylow Normalizers in Polynomial Time , 1990, J. Algorithms.

[7] Bin Fu,et al. Linear and sublinear time algorithms for the basis of abelian groups , 2009, Theor. Comput. Sci..

[8] László Babai,et al. Computational complexity and the classification of finite simple groups , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[9] J. Torán,et al. Solvable Group Isomorphism is (almost) in NP CoNP , 2004 .

[10] William M. Kantor. Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups , 1985, J. Algorithms.

[11] Gary L. Miller,et al. On the nlog n isomorphism technique (A Preliminary Report) , 1978, STOC.

[12] William M. Kantor,et al. Sylow's Theorem in Polynomial Time , 1985, J. Comput. Syst. Sci..

[13] László Babai,et al. Permutation groups in NC , 1987, STOC '87.