Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups

DOI10.1007/978-3-642-31594-7_5zbMath1272.68475OpenAlexW1854099214MaRDI QIDQ2843234

Paolo Codenotti, László Babai, Youming Qiao

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_5

zbMATH Keywords

code equivalencegroup isomorphismpermutational isomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Abstract finite groups (20D99) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (6)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ Minimum Circuit Size, Graph Isomorphism, and Related Problems ⋮ Filters compatible with isomorphism testing ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Beating the generator-enumeration bound for \(p\)-group isomorphism ⋮ Nearly linear time isomorphism algorithms for some nonabelian group classes

This page was built for publication: Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups