Fast Constructive Recognition of a Black Box Group . . . (2000)

by Sergey Bratus , Igor Pak
Venue:J. SYMBOLIC COMPUT
Citations:20 - 2 self

Documents Related by Co-Citation

67 Generating random elements of a finite group – Frank Celler, Charles R. Leedham-green, Scott H. Murray - 1995
84 Local expansion of vertex-transitive graphs and random generation in finite groups – L Babai - 1991
27 Black box classical groups – William M. Kantor, Ákos Seress
29 A Recognition Algorithm for Classical Groups over Finite Fields – Alice C. Niemeyer, Cheryl E. Praeger - 1998
46 Computation with permutation groups – Charles C Sims - 1971
22 The computational matrix group project – C R Leedham-Green - 1999
30 Las Vegas algorithms for matrix groups – R Beals, L Babai
28 Computing in Solvable Matrix Groups – Eugene Luks - 1992
12 Simple Groups in Computational Group Theory – William M. Kantor - 1998
21 Combinatorial Tools for Computational Group Theory – Gene Cooperman, Larry Finkelstein - 1993
388 Atlas of finite groups – J Conway, R Curtis, S Norton, R Parker, R Wilson - 1985
32 Randomization in group algorithms: Conceptual questions – L Babai - 1997
13 and Ákos Seress. Black box classical groups – William M Kantor
625 The Magma algebra system. I. The user language – W Bosma, J Cannon, C Playoust - 1997
70 On the complexity of matrix group problems, i – L Babai, E Szemerédi - 1984
40 Probabilistic generation of finite simple groups, II – Thomas Breuer , Robert M. Guralnick , William M. Kantor - 2008
10 On constructive recognition of a black box PSL(d, q – P A Brooksbank, W M Kantor - 2001
18 A Constructive Recognition Algorithm for the Special Linear Group – F. Celler, C. R. Leedham-Green
87 Automorphism groups, isomorphism, reconstruction – L Babai - 1995