On isomorphism testing of groups with normal Hall subgroups

DOI10.1007/s11390-012-1255-7zbMath1280.68111OpenAlexW2062702490MaRDI QIDQ2637286

Youming Qiao, Bang-Sheng Tang, M. N. Jayalal Sarma

Publication date: 11 February 2014

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2011/3044/

zbMATH Keywords

group isomorphismisomorphism testingnormal Hall subgroupproblem complexity

Mathematics Subject Classification ID

Related Items (1)

Nearly linear time isomorphism algorithms for some nonabelian group classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the deterministic complexity of factoring polynomials over finite fields
• Decomposing \(p\)-groups via Jordan algebras.
• A new algorithm for the computation of canonical forms of matrices over fields
• An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism
• Computing the structure of finite algebras
• Linear time algorithms for Abelian group isomorphism and related problems
• Hypergraph isomorphism and structural equivalence of Boolean functions
• Graph Isomorphism is not AC 0 reducible to Group Isomorphism
• Finding central decompositions of p-groups
• Factoring Groups Efficiently
• Sylow Subgroups in Parallel
• Is code equivalence easy to decide?
• Computing the structure of a finite abelian group
• On the n^{log n} isomorphism technique (A Preliminary Report)

This page was built for publication: On isomorphism testing of groups with normal Hall subgroups