Algorithms for matrix groups and the Tits alternative
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191557 (Why is no real title available?)
- scientific article; zbMATH DE number 3138253 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3850987 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3702903 (Why is no real title available?)
- scientific article; zbMATH DE number 3722702 (Why is no real title available?)
- scientific article; zbMATH DE number 66617 (Why is no real title available?)
- scientific article; zbMATH DE number 3496414 (Why is no real title available?)
- scientific article; zbMATH DE number 1256646 (Why is no real title available?)
- scientific article; zbMATH DE number 1263310 (Why is no real title available?)
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 503244 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 682071 (Why is no real title available?)
- scientific article; zbMATH DE number 742945 (Why is no real title available?)
- scientific article; zbMATH DE number 871949 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- scientific article; zbMATH DE number 3411305 (Why is no real title available?)
- scientific article; zbMATH DE number 3185046 (Why is no real title available?)
- A Recognition Algorithm for Special Linear Groups
- Algebraic properties of cryptosystem PGM
- An Algorithm for Finding the Blocks of a Permutation Group
- Computing matrix group decompositions with respect to a normal subgroup
- Computing the composition factors of a permutation group in polynomial time
- Fast Monte Carlo algorithms for permutation groups
- Free subgroups in linear groups
- Fundamental algorithms for permutation groups
- Growth of finitely generated solvable groups
- Growth of finitely generated solvable groups and curvature of Riemannian manifolds
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Lineare auflösbare Gruppen
- Polynomial-time algorithm for the orbit problem
- Testing matrix groups for primitivity
- Word Problems Solvable in Logspace
Cited in
(12)- Algorithms for arithmetic groups with the congruence subgroup property.
- On Reachability Problems for Low-Dimensional Matrix Semigroups
- On the torsion in the general linear group and the diagonalization algorithm
- Improved algorithms for the Tits alternative
- The Orbit-Stabilizer Problem for Linear Groups
- scientific article; zbMATH DE number 1004928 (Why is no real title available?)
- Computing in Nilpotent Matrix Groups
- Algorithms for computing with nilpotent matrix groups over infinite domains.
- Linear groups and computation
- scientific article; zbMATH DE number 742945 (Why is no real title available?)
- Algorithms for the Tits alternative and related problems.
- The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm.
This page was built for publication: Algorithms for matrix groups and the Tits alternative
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288201)
