Computing the composition factors of a permutation group in polynomial time
- 1 March 1987
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 7 (1) , 87-99
- https://doi.org/10.1007/bf02579204
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Permutation groups in NCPublished by Association for Computing Machinery (ACM) ,1987
- 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
- Group-Theoretic Algorithms and Graph IsomorphismLecture Notes in Computer Science, 1982
- Finite Permutation Groups and Finite Simple GroupsBulletin of the London Mathematical Society, 1981
- Polynomial-time algorithms for permutation groupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- An algorithm for finding the blocks of a permutation groupMathematics of Computation, 1975
- Computational methods in the study of permutation groups††This research was supported in part by the National Science Foundation.Published by Elsevier ,1970
- Chapter I, from Solvability of groups of odd order, Pacific J. Math, vol. 13, no. 3 (1963Pacific Journal of Mathematics, 1963