Towards effective algorithms for linear groups.
From MaRDI portal
Recommendations
Cited in
(19)- On deciding finiteness of matrix groups.
- Simple groups in computational group theory
- Algorithms in linear algebraic groups
- Linear groups and computation
- Constructive recognition of classical groups in even characteristic.
- Constructive recognition of \(\text{SL}_3(q)\).
- A computer-assisted analysis of some matrix groups.
- Short presentations for alternating and symmetric groups
- Group Embeddings with Algorithmic Properties
- On the parallel complexity of linear groups
- A space efficient algorithm for group structure computation
- On the twisted modules for finite matrix groups
- A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup
- A practical model for computation with matrix groups.
- On a variant of the product replacement algorithm
- Computational group theory: bedrock and new frontiers
- Large element orders and the characteristic of Lie-type simple groups.
- Constructive recognition of classical groups in odd characteristic.
- Fast constructive recognition of black box symplectic groups.
This page was built for publication: Towards effective algorithms for linear groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480741)
