The following pages link to (Q4190797):
Displaying 13 items.
- Computing with groups and their character tables (Q755890) (← links)
- Sylow's theorem in polynomial time (Q1063109) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744) (← links)
- Permutation group algorithms based on partitions. I: Theory and algorithms (Q1192233) (← links)
- Algebraic properties of cryptosystem PGM (Q1202919) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Finding fixed point free elements and small bases in permutation groups (Q2357380) (← links)
- Classifying the finite simple groups (Q3710670) (← links)
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations (Q3887632) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Finite groups (Q5903874) (← links)
