Pages that link to "Item:Q507137"

The following pages link to Algorithms for polycyclic-by-finite groups (Q507137):

Displaying 21 items.

• Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm (Q915859) (← links)
• Computing the Schur multiplicator and the nonabelian tensor square of a polycyclic group. (Q947504) (← links)
• The algorithmic theory of polycyclic-by-finite groups (Q1178862) (← links)
• Algorithms and geometry for graph products of groups (Q1345915) (← links)
• Finite affine groups: cycle indices, Hall-Littlewood polynomials, and probabilistic algorithms (Q1604369) (← links)
• Algorithmically complex residually finite groups (Q1682244) (← links)
• The \(p\)-group generation algorithm (Q1813916) (← links)
• Efficient collection in infinite polycyclic groups. (Q1864888) (← links)
• A practical algorithm for finding matrix representations for polycyclic groups (Q1974696) (← links)
• Computation of orders and cycle lengths of automorphisms of finite solvable groups (Q2048160) (← links)
• Universal covers of finite groups (Q2216564) (← links)
• Algorithms for symmetric groups of simplexes (Q2372040) (← links)
• Special polycyclic generating sequences for finite soluble groups. (Q2643571) (← links)
• Algorithms for twisted conjugacy classes of polycyclic-by-finite groups (Q2661717) (← links)
• Computing with infinite polycyclic groups (Q2759624) (← links)
• Representing Subgroups of Finitely Presented Groups by Quotient Subgroups (Q2775765) (← links)
• Polynomial-time algorithms for finding elements of prime order and sylow subgroups (Q3741775) (← links)
• (Q3751511) (← links)
• (Q4228737) (← links)
• (Q4335290) (← links)
• (Q4942273) (← links)