Finding Sylow Normalizers in Polynomial Time
暂无分享,去创建一个
[1] Richard Lyons,et al. The local structure of finite groups of characteristic 2 type , 1983 .
[2] William M. Kantor,et al. Sylow's Theorem in Polynomial Time , 1985, J. Comput. Syst. Sci..
[3] Lajos Rónyai,et al. Simple algebras are difficult , 1987, STOC.
[4] William M. Kantor,et al. Polynomial-Time Versions of Sylow's Theorem , 1988, J. Algorithms.
[5] William M. Kantor. Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups , 1985, J. Algorithms.
[6] László Babai. On the length of subgroup chains in the symmetric group , 1986 .
[7] 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).
[8] Eugene M. Luks. Computing the composition factors of a permutation group in polynomial time , 1987, Comb..
[9] B. Huppert. Endliche Gruppen I , 1967 .
[10] A. J. Weir. SYLOW p-SUBGROUPS OF THE CLASSICAL GROUPS OVER FINITE FIELDS WITH CHARACTERISTIC PRIME TO p , 1955 .
[11] R. Carter,et al. The sylow 2-subgroups of the finite classical groups , 1964 .
[12] John E. Hopcroft,et al. Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[13] Eugene M. Luks,et al. Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[14] Charles C. Sims,et al. Some group-theoretic algorithms , 1978 .
[15] J. Dieudonné,et al. La géométrie des groupes classiques , 1963 .