Permutation group algorithms via black box recognition algorithms (1997) [8 citations — 4 self]

Download:

by William M. Kantor, Akos Seress

Math. Soc. Lecture Note Ser., 261

http://darkwing.uoregon.edu/~kantor/PAPERS/finalBATH.ps

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Kantor97permutationgroup,
    author = {William M. Kantor and Akos Seress},
    title = {Permutation group algorithms via black box recognition algorithms},
    booktitle = {Math. Soc. Lecture Note Ser., 261},
    year = {1997},
    pages = {436--446},
    publisher = {Univ. Press}
}

Abstract:

algorithms

Citations

58	Local expansion of vertex-transitive graphs and random generation in finite groups – Babai - 1991
44	Generating random elements of a finite group – Celler, Leedham-Green, et al. - 1995
30	A recognition algorithm for special linear groups – Neumann, Praeger - 1992
20	A Recognition Algorithm for Classical Groups over Finite Fields – Niemeyer, Praeger - 1998
19	A non-constructive recognition algorithm for the special linear and other classical groups – Celler, Leedham-Green - 1998
17	Sylow's theorem in polynomial time – Kantor - 1985
11	Short presentations for finite groups – Babai, Goodman, et al. - 1997
10	Akos Seress. Fast management of permutation groups I – Babai, M - 1997
9	Permutation groups in NC – Babai, Luks, et al. - 1987
7	A non-constructive recognition algorithm for the special linear and other classical groups – Celler, Leedham-Green - 1997
7	Implementing a recognition algorithm for classical groups – Niemeyer, Praeger - 1997
6	A random base change algorithm for permutation groups – Cooperman, Finkelstein, et al. - 1990
6	Fast recognition of the nilpotency of permutation groups – Rakoczi - 1995
4	Akos Seress. Nearly linear time algorithms for permutation groups with a small base – Babai, Cooperman, et al. - 1991
4	A nearly linear algorithm for Sylow subgroups of permutation groups – Morje - 1995
3	Structure forest and composition factors for small base groups in nearly linear time – Beals - 1992
3	Recognizing GL n (2) in non-standard representation – Cooperman, Finkelstein, et al.
3	Nearly linear time algorithms for permutation groups: An interplay between theory and practice – SERESS - 1997
2	Praeger and ' A. Seress, A m'elange of black box algorithms for recognising finite symmetric and alternating groups (in preparation – Beals, Leedham-Green, et al.
2	Black box classical groups (submitted – Kantor
2	Computing the Fitting subgroup and solvable radical of small-base permutation grops in nearly linear time – Luks
2	Finding blocks of imprimitivity in small-base groups in nearly linear time – Schonert - 1994
2	Computation with permutation groups, pp. 23--28 in – Sims - 1971
1	A polynomial-time theory of matrix groups and black box groups – Babai, Beals
1	Luks and ' A. Seress, Fast management of permutation groups II (in preparation – Babai, M
1	Primitive prime divisor elements in finite classical groups – Praeger
1	Computational methods in the study of permutation groups, pp. 169--183 in: Computational problems in abstract algebra – Sims - 1970

View or Download | Add to My Collection | Correct Errors