Finding Sylow normalizers in polynomial time
- 31 December 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (4) , 523-563
- https://doi.org/10.1016/0196-6774(90)90009-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Polynomial-time versions of Sylow's theoremJournal of Algorithms, 1988
- Computing the composition factors of a permutation group in polynomial timeCombinatorica, 1987
- On the length of subgroup chains in the symmetric groupCommunications in Algebra, 1986
- Polynomial-time algorithms for finding elements of prime order and sylow subgroupsJournal of Algorithms, 1985
- Sylow's theorem in polynomial timeJournal of Computer and System Sciences, 1985
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- The sylow 2-subgroups of the finite classical groupsJournal of Algebra, 1964