Pages that link to "Item:Q1311608"

The following pages link to Graph isomorphism problem and \(2\)-closed permutation groups (Q1311608):

Displaying 11 items.

• Two-closures of supersolvable permutation groups in polynomial time (Q777912) (← links)
• On the asymmetric complexity of the group-intersection problem (Q963437) (← links)
• On isomorphism testing of a class of 2-nilpotent groups (Q1174452) (← links)
• On finite totally \(2\)-closed groups (Q2080939) (← links)
• The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time (Q2313298) (← links)
• Closures of finite permutation groups (Q2680584) (← links)
• Permutation Groups and the Graph Isomorphism Problem (Q2821703) (← links)
• Finite nilpotent groups that coincide with their 2-closures in all of their faithful permutation representations (Q4638599) (← links)
• GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM (Q5122158) (← links)
• Two-closure of rank \(3\) groups in polynomial time (Q6170785) (← links)
• On computing the closures of solvable permutation groups (Q6195309) (← links)