Publication:2759618
From MaRDI portal
zbMath1052.20031MaRDI QIDQ2759618
Publication date: 2001
symplectic groups; generators; orthogonal groups; unitary groups; polynomial time algorithms; nonabelian composition factors; exceptional groups; minimal normal subgroups; simple groups of Lie type; black-box groups; asymptotic complexity; matrix groups over finite fields; Monte Carlo polynomial time algorithms
68W30: Symbolic computation and algebraic computation
20G40: Linear algebraic groups over finite fields
20D06: Simple groups: alternating groups and groups of Lie type
Related Items
Finite simple unisingular groups of Lie type, Element orders in covers of finite simple groups of Lie type, Constructive recognition of 𝑃𝑆𝐿(2,𝑞), A practical model for computation with matrix groups., Recognising simplicity of black-box groups by constructing involutions and their centralisers., Characterizations of the simple group \(^2D_n(3)\) by prime graph and spectrum., Recognising tensor-induced matrix groups., Constructing composition factors for a linear group in polynomial time, A computer-assisted analysis of some matrix groups., Recognition of finite exceptional groups of Lie type, Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas