Pages that link to "Item:Q3731029"
From MaRDI portal
The following pages link to A compact representation for permutation groups (Q3731029):
Displaying 24 items.
- Discrete groups of slow subgroup growth (Q677419) (← links)
- Computing the order of a solvable permutation group (Q913945) (← links)
- Efficient representation of perm groups (Q1180408) (← links)
- Fast recognition of doubly transitive groups (Q1192228) (← links)
- A strong generating test and short presentations for permutation groups (Q1192229) (← links)
- Permutation group algorithms based on partitions. I: Theory and algorithms (Q1192233) (← links)
- New methods for using Cayley graphs in interconnection networks (Q1199417) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- Constructing permutation representations for matrix groups (Q1369807) (← links)
- Minimal and canonical images (Q1755579) (← links)
- Partitions and permutations (Q1772267) (← links)
- Chains of subsemigroups (Q2014292) (← links)
- Faster tensor canonicalization (Q2102478) (← links)
- Space efficient representations of finite groups (Q2194866) (← links)
- On the membership problem for finite automata over symmetric groups (Q2685503) (← links)
- Symmetry robust memory management of multidimensional arrays (Q2741460) (← links)
- Effective Invariant Theory of Permutation Groups Using Representation Theory (Q2947147) (← links)
- Generating Permutation Groups (Q3155509) (← links)
- Expanding Generating Sets for Solvable Permutation Groups (Q3176493) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- On the length of subgroup chains in the symmetric group (Q3741778) (← links)
- (Q4449187) (← links)
- A method for building permutation representations of finitely presented groups (Q5138285) (← links)
- Computational Complexity of Computing Symmetries in Finite-Domain Planning (Q5856495) (← links)
