Pages that link to "Item:Q3022123"
From MaRDI portal
The following pages link to Finding the automorphism group of a circulant association scheme in polynomial time (Q3022123):
Displaying 8 items.
- Computing isomorphisms of association schemes and its application (Q597120) (← links)
- Finding a cycle base of a permutation group in polynomial time (Q724293) (← links)
- Two-closures of supersolvable permutation groups in polynomial time (Q777912) (← links)
- Permutation group approach to association schemes (Q1039422) (← links)
- Recognizing circulant graphs of prime order in polynomial time (Q1386147) (← links)
- Generalized dihedral CI-groups (Q5090191) (← links)
- Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm (Q5743082) (← links)
- Recognizing circulant graphs in polynomial time: An application of association schemes (Q5940668) (← links)