Fast Management of Permutation Groups I

DOI10.1137/S0097539794229417zbMath0885.68090OpenAlexW2131472298MaRDI QIDQ4376174

Seress, Ákos, László Babai, Eugene M. Luks

Publication date: 10 February 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794229417

zbMATH Keywords

strong generating setpermutation group algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items

The complexity of intersecting finite automata having few final states, Experimenting with Symplectic Hypergeometric Monodromy Groups, Constructing composition factors for a linear group in polynomial time, On the automorphism groups of strongly regular graphs. II., Linear optimization over permutation groups, On the degree of transitivity of permutation groups: A short proof, A Reduction Algorithm for Large-Base Primitive Permutation Groups