scientific article
From MaRDI portal
Publication:3101023
zbMath1237.20002MaRDI QIDQ3101023
Publication date: 22 November 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
membership problemchief seriesefficient algorithmslinear groups over finite fieldsconstructive recognitioncomputational group theoryblack-box algorithmsmatrix recognitionAschbacher theorem
Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Research exposition (monographs, survey articles) pertaining to group theory (20-02)
Related Items (11)
Gaussian elimination in unitary groups with an application to cryptography ⋮ Recognising the small Ree groups in their natural representations. ⋮ Constructing composition factors for a linear group in polynomial time ⋮ Constructive recognition of classical groups in even characteristic. ⋮ Fast recognition of alternating groups of unknown degree. ⋮ Effective black-box constructive recognition of classical groups. ⋮ A practical model for computation with matrix groups. ⋮ Recognition of finite exceptional groups of Lie type ⋮ Presentations on standard generators for classical groups ⋮ Linear groups and computation ⋮ Algorithms for the Tits alternative and related problems.
This page was built for publication:
