Pages that link to "Item:Q581532"
From MaRDI portal
The following pages link to Computing the composition factors of a permutation group in polynomial time (Q581532):
Displaying 13 items.
- On the nilpotent Lie algebras of dimension \(\leq 7)\) (Q1076782) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744) (← links)
- Finding composition factors of permutation groups of degree \(n\leq 10^ 6\) (Q1192231) (← links)
- Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
- On the degree of transitivity of permutation groups: A short proof (Q1821193) (← links)
- Subcomplete generalizations of graph isomorphism (Q1838044) (← links)
- Constructing composition factors for a linear group in polynomial time (Q2193255) (← links)
- Isomorphism testing of groups of cube-free order (Q2282990) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- (Q4234185) (← links)
- Conjugacy classes in finite permutation groups via homomorphic images (Q4501044) (← links)
- (Q4660701) (← links)
