Publication:4240509

zbMath0942.20032MaRDI QIDQ4240509

Robert Beals, László Babai

Publication date: 13 August 2000

zbMATH Keywords

composition factors; Monte Carlo algorithms; matrix groups over finite fields

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

20G40: Linear algebraic groups over finite fields

20-04: Software, source code, etc. for problems pertaining to group theory

68W20: Randomized algorithms

Related Items

Black-box recognition of finite simple groups of Lie type by statistics of element orders, Algorithms for Group Isomorphism via Group Extensions and Cohomology, Unnamed Item, Recognising the small Ree groups in their natural representations., A practical model for computation with matrix groups., Recognising simplicity of black-box groups by constructing involutions and their centralisers., The product replacement prospector., Large element orders and the characteristic of Lie-type simple groups., Prime power graphs for groups of Lie type, Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\), Constructing composition factors for a linear group in polynomial time, Constructive recognition of classical groups in even characteristic., Computing conjugacy classes of elements in matrix groups., Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules., Recognition of finite exceptional groups of Lie type, Black box exceptional groups of Lie type, Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas, Structure computation and discrete logarithms in finite abelian $p$-groups, Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations