Pages that link to "Item:Q1816737"
From MaRDI portal
The following pages link to An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism (Q1816737):
Displaying 9 items.
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- Linear and sublinear time algorithms for the basis of abelian groups (Q553345) (← links)
- Space efficient representations of finite groups (Q2194866) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
- Linear time algorithms for Abelian group isomorphism and related problems (Q2643019) (← links)
- Testing commutativity of a group and the power of randomization (Q5169624) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5918355) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
