The following pages link to (Q5365126):
Displaying 12 items.
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- Computing normalisers of intransitive groups (Q2142483) (← links)
- Isomorphism testing of groups of cube-free order (Q2282990) (← links)
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes (Q2324762) (← links)
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property (Q2333818) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
- Computing an Invariant of a Linear Code (Q5014679) (← links)
- (Q5241158) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
- Transversal diagonal logical operators for stabiliser codes (Q6559766) (← links)
