The following pages link to (Q4273608):
Displaying 7 items.
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Computing the subgroups of a permutation group (Q5928886) (← links)
- A nonadaptive NC checker for permutation group intersection (Q5941295) (← links)
- A Faster Isomorphism Test for Graphs of Small Degree (Q6139827) (← links)
- Comparison of Atom Maps (Q6167503) (← links)
- Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms (Q6566798) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
