Complexity and computation in matrix groups.

MaRDI QIDQ2776271zbMATH OpenFDO

Authors Alice C. Niemeyer, Cheryl E. Praeger

Publication date 2001

zbMATH Keywords

black box recognitionlinear groups over finite fieldsrandom elementsrandomised algorithms

Mathematics Subject Classification ID

Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1981751
• Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
• The computational matrix group project.
• scientific article; zbMATH DE number 1284153
• A Recognition Algorithm For Classical Groups Over Finite Fields

Cited in

(10)

• Selecting base points for the Schreier-Sims algorithm for matrix groups
• The computational matrix group project.
• scientific article; zbMATH DE number 1302483 (Why is no real title available?)
• scientific article; zbMATH DE number 475364 (Why is no real title available?)
• scientific article; zbMATH DE number 1004928 (Why is no real title available?)
• The Computational Complexity to Evaluate Representations of General Linear Groups
• On complexity of multiplication in finite soluble groups.
• A practical model for computation with matrix groups.
• Randomness and complexity in matrix groups
• Computational complexity of immanents and representations of the full linear group

This page was built for publication: Complexity and computation in matrix groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776271)