A black-box group algorithm for recognizing finite symmetric and alternating groups, I

Journal article

Open access

Robert Beals, Charles R LEEDHAM-GREEN, Alice C Niemeyer, Cheryl E Praeger and Akos Seress

Transactions of the American Mathematical Society, Vol.355(5), pp.2097-2113

2003

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Group theory

Group theory and generalizations

Mathematics

Sciences and techniques of general use

Theoretical computing

url

https://doi.org/10.1090/S0002-9947-03-03040-XView

Version of Record (VoR) Open

7 Record Views

Title: A black-box group algorithm for recognizing finite symmetric and alternating groups, I
Creators: Robert Beals - Ida Center for Communications Research, 805 Bunn Drive, Princeton, New Jersey 08540, United States
Charles R LEEDHAM-GREEN - School of Mathematical Sciences, Queen Mary and Westfield College, London E1 4NS, United Kingdom
Alice C Niemeyer - Department of Mathematics and Statistics, University of Western Australia, Crawley, Western Australia 6009, Australia
Cheryl E Praeger - Department of Mathematics and Statistics, University of Western Australia, Crawley, Western Australia 6009, Australia
Akos Seress - Department of Mathematics, The Ohio State University, Columbus, Ohio 43210, United States
Publication Details: Transactions of the American Mathematical Society, Vol.355(5), pp.2097-2113
Date published: 2003
Publisher: American Mathematical Society
Academic Unit: Mathematics (SAS)
Language: English
Resource Type: Journal article
Identifiers: 991031665546004646