The following pages link to (Q4133821):
Displaying 14 items.
- Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm (Q915859) (← links)
- Computing intersections and normalizers in soluble groups (Q919456) (← links)
- Model-theoretic and algorithmic questions in group theory (Q1063112) (← links)
- Towards a soluble quotient algorithm (Q1097350) (← links)
- Computing with Abelian sections of finitely presented groups (Q1291087) (← links)
- Computing a set of generators of minimal cardinality in a solvable group (Q1333156) (← links)
- Counting homomorphisms onto finite solvable groups. (Q1771339) (← links)
- A finite soluble quotient algorithm (Q1897565) (← links)
- Computing the soluble radical of a permutation group. (Q2496868) (← links)
- Algorithms for finite soluble groups and applications (Q2762217) (← links)
- Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients (Q3092001) (← links)
- Computational approaches to the theory of finite soluble groups (Q3774056) (← links)
- Computing double cosets in soluble groups (Q5928888) (← links)
- Computing projectors, injectors, residuals and radicals of finite soluble groups (Q5950984) (← links)
