Computing in Permutation and Matrix Groups II: Backtrack Algorithm
From MaRDI portal
Publication:3344110
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)