A compact representation for permutation groups
From MaRDI portal
Publication:3731029
DOI10.1016/0196-6774(86)90038-6zbMath0597.68036OpenAlexW1993524657WikidataQ55898860 ScholiaQ55898860MaRDI QIDQ3731029
Publication date: 1986
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(86)90038-6
data structurerepresentativesisomorph rejectionefficient algorithm for generating systems of cosetefficient algorithm for generating systems of coset representativesfast membership testing
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to group theory (20-04) General theory for finite permutation groups (20B05)
Related Items
Generating Permutation Groups, Generation of Colourings and Distinguishing Colourings of Graphs, Expanding Generating Sets for Solvable Permutation Groups, On the length of subgroup chains in the symmetric group, On the membership problem for finite automata over symmetric groups, Computing the order of a solvable permutation group, Efficient representation of perm groups, Discrete groups of slow subgroup growth, Fast recognition of doubly transitive groups, A strong generating test and short presentations for permutation groups, New methods for using Cayley graphs in interconnection networks, Graph isomorphism is low for PP, Chains of subsemigroups, Partitions and permutations, Computational Complexity of Computing Symmetries in Finite-Domain Planning, Faster tensor canonicalization
