Nearly linear time algorithms for permutation groups with a small base

Authors:
László Babai;Gene Cooperman;Larry Finkelstein;Ákos Seress
Affiliations:
Dept. of Comp. Science, University of Chicago, Chicago, Illinois and Dept. of Algebra, Eötvös University, Budapest, Hungary H-1088;College of Comp. Science, Northeastern University, Boston, Mass.;College of Comp. Science, Northeastern University, Boston, Mass.;Dept. of Mathematics, Ohio State University, Columbus, Ohio
Venue:
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Year:
1991

Citing 8
Cited 12

A compact representation for permutation groups

Journal of Algorithms
A new base change algorithm for permutation groups

SIAM Journal on Computing
A random base change algorithm for permutation groups

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Fast Monte Carlo algorithms for permutation groups

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Local expansion of vertex-transitive graphs and random generation in finite groups

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Bounded round interactive proofs in finite groups

SIAM Journal on Discrete Mathematics
A strong generating test and short presentations for permutation groups

Journal of Symbolic Computation - Special issue on computational group theory: part 2
Computation with permutation groups

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation

Structure forest and composition factors for small base groups in nearly linear time

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Deciding finiteness of matrix groups in Las Vegas polynomial time

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A fast cyclic base change for permutation groups

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
An elementary algorithm for computing the composition factors of a permutation group

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Finding blocks of imprimitivity in small-base groups in nearly linear time

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Computing with matrix groups using permutation representations

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A nearly linear algorithm for Sylow subgroups in small-base groups

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
The growth rate of vertex-transitive planar graphs

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Memory-based and disk-based algorithms for very high degree permutation groups

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
A data structure for a uniform approach to computations with finite groups

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications

Quantified Score

Hi-index	0.00

Nearly linear time algorithms for permutation groups with a small base

Quantified Score

Visualization

Abstract