Computing in Permutation and Matrix Groups II: Backtrack Algorithm

DOI10.2307/2007344zbMath0552.20003OpenAlexW4240099710MaRDI QIDQ3344110

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

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

Related Items (8)

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

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