Complexity and computation in matrix groups.
type: Item
instance of: scholarly article
zbMATH Open document ID: 1052.20035
author: Alice C. Niemeyer
author: Cheryl E. Praeger
publication date: 2001-01-01T00:00:00Z
Mathematics Subject Classification ID: 20G40
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 20P05
zbMATH DE Number: 1714456
zbMATH Keywords: linear groups over finite fields
zbMATH Keywords: randomised algorithms
zbMATH Keywords: black box recognition
zbMATH Keywords: random elements
MaRDI profile type: MaRDI publication profile
title: Complexity and computation in matrix groups.
Recommended article: Q4426040
Recommended article: Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
Recommended article: The computational matrix group project.
Recommended article: Q4240509
Recommended article: A Recognition Algorithm For Classical Groups Over Finite Fields
description: scientific article; zbMATH DE number 1714456