Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Babai, P. Pálfy, J. Saxl (2009)
On the Number of p -Regular Elements in Finite Simple GroupsLms Journal of Computation and Mathematics, 12
A. Hulpke, Á. Seress (2001)
Short Presentations for Three-Dimensional Unitary Groups☆Journal of Algebra, 245
R. Wilson, J. Conway, S. Norton (1985)
ATLAS of Finite Groups
W. Feit, J. Tits (1978)
Projective Representations of Minimum Degree of Group ExtensionsCanadian Journal of Mathematics, 30
E. Luks (1987)
Computing the composition factors of a permutation group in polynomial timeCombinatorica, 7
D. Holt, Sarah Rees (1994)
Testing modules for irreducibilityJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 57
P. Shor (1995)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Rev., 41
M. Conder, C. Leedham-Green, E. O'Brien (2005)
Constructive recognition of $\mathrm{PSL}(2, q)$Transactions of the American Mathematical Society, 358
L. Babai, W. Kantor, P. Pálfy, Á. Seress (2002)
Black-box recognition of finite simple groups of Lie type by statistics of element ordersJournal of Group Theory, 5
W. Kantor (1985)
Sylow's Theorem in Polynomial TimeJ. Comput. Syst. Sci., 30
(1999)
A polynomial-time theory of black-box groups I. In Groups St Andrews 1997 in Bath, I, pp
(1980)
Proc. 21st FOCS
L. Babai, A. Goodman, W. Kantor, E. Luks, P. Pálfy (1992)
Short Presentations for Finite GroupsJournal of Algebra, 194
L. Babai (1991)
Local expansion of vertex-transitive graphs and random generation in finite groups
W. Kantor, Á. Seress (2001)
Black Box Classical Groups
E. Luks (1992)
Computing in solvable matrix groupsProceedings., 33rd Annual Symposium on Foundations of Computer Science
J. Bray (2000)
An improved method for generating the centralizer of an involutionArchiv der Mathematik, 74
E. Luks (1996)
Permutation Groups and Polynomial-Time Computation
P. Brooksbank (2003)
Fast Constructive Recognition of Black-Box Unitary GroupsLms Journal of Computation and Mathematics, 6
L. Babai, R. Beals (1999)
Groups St Andrews 1997 in Bath, I: A polynomial-time theory of black box groups I
R. Beals, L. Babai (1993)
Las Vegas algorithms for matrix groupsProceedings of 1993 IEEE 34th Annual Foundations of Computer Science
M. Conder, C. Leedham-Green, E. O'Brien (2005)
CONSTRUCTIVE RECOGNITION OF PSL(2, q)
P. Brooksbank, W. Kantor (2001)
On constructive recognition of a black box PSL
L. Babai, E. Szemerédi (1984)
On the Complexity of Matrix Group Problems I
Á. Seress (2003)
Permutation Group Algorithms
L. Babai, G. Cooperman, L. Finkelstein, E. Luks, Á. Seress (1991)
Fast Monte Carlo algorithms for permutation groups
E. Shult (1972)
On a class of doubly transitive groupsIllinois Journal of Mathematics, 16
D. Knuth (1991)
Efficient representation of perm groupsCombinatorica, 11
Alex Gamburd, I. Pak (2002)
Expansion Of Product Replacement GraphsCombinatorica, 26
L. Babai (1985)
Trading group theory for randomness
E. Bach, J. Shallit (1996)
Algorithmic number theory
P. Brooksbank, W. Kantor (2006)
Fast constructive recognition of black box orthogonal groupsJournal of Algebra, 300
(1995)
and E
R. Beals (1995)
Towards polynomial time algorithms for matrix groups
George Polites (1968)
An introduction to the theory of groups
G. Ivanyos, Klaus Lux (2000)
Treating the Exceptional Cases of the MeatAxeExperimental Mathematics, 9
F. Celler, C. Leedham-Green, Scott Murray, Alice Niemeyer, E. O'Brien (1995)
Generating random elements of a finite groupCommunications in Algebra, 23
C. Parker, R. Wilson (2010)
Recognising simplicity of black-box groups by constructing involutions and their centralisersJournal of Algebra, 324
C. Sims (1971)
Computation with permutation groups
Vicente Landázuri, G. Seitz (1974)
On the minimal degrees of projective representations of the finite Chevalley groupsJournal of Algebra, 158
P. Holmes, S. Linton, E. O'Brien, A. Ryba, R. Wilson (2008)
Constructive membership in black-box groups, 11
J. Dixon (2008)
Generating Random Elements in Finite GroupsElectron. J. Comb., 15
M. Furst, J. Hopcroft, E. Luks (1980)
Polynomial-time algorithms for permutation groups21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
L. Babai (2006)
Monte-Carlo algorithms in graph isomorphism testing
P. Brooksbank (2008)
Fast constructive recognition of black box symplectic groupsJournal of Algebra, 320
C. Leedham-Green, Alice Niemeyer, C. Praeger, Á. Seress (2003)
A black-box group algorithm for recognizing finite symmetric and alternating groups, ITransactions of the American Mathematical Society, 355
L. Babai, A. Shalev (2008)
Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups
W. Kantor (2002)
Computing with matrix groups
(1993)
IEEE Comp. Soc
S. Aaronson, G. Kuperberg (2006)
Quantum versus Classical Proofs and AdviceTwenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
Christine Altseimer, A. Borovik (2001)
Probabilistic recognition of orthogo-nal and symplectic groups
L. Rónyai (1990)
Computing the Structure of Finite AlgebrasJ. Symb. Comput., 9
C. Sims (1970)
Computational methods in the study of permutation groups
E. Luks, Á. Seress (1995)
Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time
C. Parker, R. Wilson (2005)
Recognising simplicity of black-box groups
Proceedings of the forty-first annual ACM symposium on Theory of computing – Unpaywall
Published: May 31, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.