Permutation groups in NC

Authors:
L. Babai;E. Luks;A. Seress
Affiliations:
Eötvös University, Budapest, and University of Chicago;University of Oregon;Mathematical Institute of the Hungarian Academy of Sciences
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 5
Cited 16

Computing the composition factors of a permutation group in polynomial time

Combinatorica
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field

Combinatorica
The Classifikation of Problems which have Fast Parallel Algorithms

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Isomorphism of graphs with bounded eigenvalue multiplicity

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Fast parallel computation with permutation groups

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Computing in quotient groups

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
Parallel computation over hyperbolic groups

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Symmetry and complexity

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The membership problem in aperiodic transformation monoids

Journal of the ACM (JACM)
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
Hypergraph isomorphism and structural equivalence of Boolean functions

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Nonadaptive NC Checker for Permutation Group Intersection

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Generation problems

Theoretical Computer Science - Mathematical foundations of computer science 2004
A data structure for a uniform approach to computations with finite groups

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Factoring Groups Efficiently

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
On graph isomorphism for restricted graph classes

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Code equivalence and group isomorphism

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the automorphism groups of strongly regular graphs I

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G by a list of generators, we find a set of NC-efficient strong generators in NC. Using this, we show, that the following problems are in NC: membership in G; determining the order of G; finding the center of G; finding a composition series of G along with permutation representations of each composition factor. Moreover, given G, we are able to find the pointwise stabilizer of a set in NC. One consequence is that isomorphism of graphs with bounded multiplicity of eigenvalues is in NC.The analysis of the algorithms depends, in several ways, on consequences of the classification of finite simple groups.