An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism
From MaRDI portal
Publication:1816737
DOI10.1006/jcss.1996.0045zbMath0859.68048OpenAlexW2036256728MaRDI QIDQ1816737
Publication date: 27 November 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0045
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ On isomorphism testing of groups with normal Hall subgroups ⋮ Linear time algorithms for Abelian group isomorphism and related problems ⋮ Space efficient representations of finite groups ⋮ Beating the generator-enumeration bound for \(p\)-group isomorphism ⋮ Testing commutativity of a group and the power of randomization ⋮ Linear and sublinear time algorithms for the basis of abelian groups ⋮ Nearly linear time isomorphism algorithms for some nonabelian group classes
This page was built for publication: An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism