scientific article
From MaRDI portal
Publication:2759618
zbMath1052.20031MaRDI QIDQ2759618
Publication date: 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
symplectic groupsgeneratorsorthogonal groupsunitary groupspolynomial time algorithmsnonabelian composition factorsexceptional groupsminimal normal subgroupssimple groups of Lie typeblack-box groupsasymptotic complexitymatrix groups over finite fieldsMonte Carlo polynomial time algorithms
Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Simple groups: alternating groups and groups of Lie type (20D06)
Related Items (11)
Recognising simplicity of black-box groups by constructing involutions and their centralisers. ⋮ Constructing composition factors for a linear group in polynomial time ⋮ A practical model for computation with matrix groups. ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Characterizations of the simple group \(^2D_n(3)\) by prime graph and spectrum. ⋮ A computer-assisted analysis of some matrix groups. ⋮ Recognition of finite exceptional groups of Lie type ⋮ Finite simple unisingular groups of Lie type ⋮ Element orders in covers of finite simple groups of Lie type ⋮ Recognising tensor-induced matrix groups.
This page was built for publication:
