Computing in Permutation and Matrix Groups II: Backtrack Algorithm

DOI10.2307/2007344MaRDI QIDQ3344110zbMATH OpenOpenAlexFDO

Authors Gregory Butler

Publication date 1982

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2007344

zbMATH Keywords

backtrack algorithms

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Generators, relations, and presentations of groups (20F05) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)

Cited in

(8)

• Effective computation with group homomorphisms
• Computing in permutation and matrix groups. III: Sylow subgroups
• The computation of normalizers in permutation groups
• Permutation group algorithms based on partitions. I: Theory and algorithms
• New methods for using Cayley graphs in interconnection networks
• Symmetric ILP: Coloring and small integers
• Towards efficient normalizers of primitive groups
• A proof of Holt's algorithm

This page was built for publication: Computing in Permutation and Matrix Groups II: Backtrack Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344110)