Pages that link to "Item:Q1063109"
From MaRDI portal
The following pages link to Sylow's theorem in polynomial time (Q1063109):
Displaying 12 items.
- Computing the composition factors of a permutation group in polynomial time (Q581532) (← links)
- Constructing normalisers in finite soluble groups (Q1108366) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Finding composition factors of permutation groups of degree \(n\leq 10^ 6\) (Q1192231) (← links)
- Graph isomorphism problem and \(2\)-closed permutation groups (Q1311608) (← links)
- Constructing composition factors for a linear group in polynomial time (Q2193255) (← links)
- Constructive Sylow theorems for the classical groups. (Q2464490) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- On the length of subgroup chains in the symmetric group (Q3741778) (← links)
- Computing Hall subgroups of finite groups (Q5169635) (← links)
- Two-closure of rank \(3\) groups in polynomial time (Q6170785) (← links)
- Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality (Q6184182) (← links)
