The Parallel Complexity of Abelian Permutation Group Problems
From MaRDI portal
Publication:3792240
DOI10.1137/0216058zbMath0647.68045MaRDI QIDQ3792240
Pierre McKenzie, Stephen A. Cook
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216058
finite Abelian groups; parallel complexity; parallel processing; intersection of permutation groups; optimal paths in graphs; representation of generators as permutations
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
20K01: Finite abelian groups
20B35: Subgroups of symmetric groups
Related Items
The parallel complexity of graph canonization under abelian group action, Membership testing in commutative transformation semigroups, Parallel algorithms for solvable permutation groups, An \(NC^ 2\) algorithm for testing similarity of matrices, On the parallel complexity of linear groups