Computing the composition factors of a permutation group in polynomial time
From MaRDI portal
Publication:581532
DOI10.1007/BF02579204zbMath0627.20002MaRDI QIDQ581532
Publication date: 1987
Published in: Combinatorica (Search for Journal in Brave)
generatorsprimitive permutation groupspermutation groupcomposition factorscomplexity analysispolynomial time algorithms
Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04) Primitive groups (20B15) Subgroups of symmetric groups (20B35) General theory for finite permutation groups (20B05) Algorithms in computer science (68W99)
Related Items
On the nilpotent Lie algebras of dimension \(\leq 7)\), Parallel algorithms for solvable permutation groups, Constructing composition factors for a linear group in polynomial time, Isomorphism of graphs of bounded valence can be tested in polynomial time, Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas, Finding composition factors of permutation groups of degree \(n\leq 10^ 6\), Isomorphism testing of groups of cube-free order, On the degree of transitivity of permutation groups: A short proof, Algorithms for matrix groups and the Tits alternative, Subcomplete generalizations of graph isomorphism, Conjugacy classes in finite permutation groups via homomorphic images
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sylow's theorem in polynomial time
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Solvability of groups of odd order
- Polynomial-time algorithms for finding elements of prime order and sylow subgroups
- Polynomial-time versions of Sylow's theorem
- Finite Permutation Groups and Finite Simple Groups
- An Algorithm for Finding the Blocks of a Permutation Group
