Pages that link to "Item:Q3887632"
From MaRDI portal
The following pages link to On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (Q3887632):
Displaying 24 items.
- The Canon package: a fast kernel for tensor manipulators (Q709478) (← links)
- Computing with groups and their character tables (Q755890) (← links)
- A computer program for the calculation of a covering group of a finite group (Q801032) (← links)
- Computing the order of a solvable permutation group (Q913945) (← links)
- A proof of Holt's algorithm (Q921108) (← links)
- Effective computation with group homomorphisms (Q1062134) (← links)
- The mechanical computation of first and second cohomology groups (Q1072655) (← links)
- A general backtrack algorithm for the isomorphism problem of combinatorial objects (Q1087556) (← links)
- Computing in permutation and matrix groups. III: Sylow subgroups (Q1123257) (← links)
- Self-dual codes over GF(5) (Q1163524) (← links)
- Fast recognition of doubly transitive groups (Q1192228) (← links)
- A strong generating test and short presentations for permutation groups (Q1192229) (← links)
- Computing with group homomorphisms (Q1192232) (← links)
- Permutation group algorithms based on partitions. I: Theory and algorithms (Q1192233) (← links)
- Processor interconnection networks from Cayley graphs (Q1208451) (← links)
- Discrete logarithms for finite groups (Q2390938) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- A computer-assisted analysis of some matrix groups. (Q2496862) (← links)
- Some results on quotients of triangle groups (Q3337640) (← links)
- Use of computers in solving well-known algebra problems (Q3599851) (← links)
- An Inductive Schema for Computing Conjugacy Classes in Permutation Groups (Q4286607) (← links)
- (Q4625700) (← links)
- An algorithm for finding minimal generating sets of finite groups (Q5076993) (← links)
- Finite groups (Q5903874) (← links)