Algorithms for matrix groups and the Tits alternative

DOI10.1006/jcss.1998.1614zbMath0922.68064OpenAlexW1908282360MaRDI QIDQ1288201

Robert Beals

Publication date: 11 May 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1614

zbMATH Keywords

asymptotic complexity theory

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Algorithms for computing with nilpotent matrix groups over infinite domains. ⋮ Linear groups and computation ⋮ On Reachability Problems for Low-Dimensional Matrix Semigroups ⋮ Algorithms for the Tits alternative and related problems. ⋮ Computing in Nilpotent Matrix Groups

Uses Software

• GAP
• Cayley

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the composition factors of a permutation group in polynomial time
• Lineare auflösbare Gruppen
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Fundamental algorithms for permutation groups
• Algebraic properties of cryptosystem PGM
• Testing matrix groups for primitivity
• Computing matrix group decompositions with respect to a normal subgroup
• Fast Monte Carlo algorithms for permutation groups
• Growth of finitely generated solvable groups
• Growth of finitely generated solvable groups and curvature of Riemannian manifolds
• Free subgroups in linear groups
• Polynomial-time algorithm for the orbit problem
• A Recognition Algorithm for Special Linear Groups
• An Algorithm for Finding the Blocks of a Permutation Group
• Word Problems Solvable in Logspace

This page was built for publication: Algorithms for matrix groups and the Tits alternative