scientific article; zbMATH DE number 6783478

zbMath1382.20037MaRDI QIDQ5365126

László Babai, Joshua A. Grochow, Youming Qiao, Paolo Codenotti

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133143

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Generators, relations, and presentations of groups (20F05) Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (10)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Computing normalisers of intransitive groups ⋮ On isomorphism testing of groups with normal Hall subgroups ⋮ Unnamed Item ⋮ Beating the generator-enumeration bound for \(p\)-group isomorphism ⋮ Isomorphism testing of groups of cube-free order ⋮ On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes ⋮ Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property ⋮ Computing an Invariant of a Linear Code

This page was built for publication: