Pages that link to "Item:Q2643019"
From MaRDI portal
The following pages link to Linear time algorithms for Abelian group isomorphism and related problems (Q2643019):
Displaying 11 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)
- Compact data structures for Dedekind groups and finite rings (Q2232236) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) (Q2693019) (← links)
- EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS (Q2905283) (← links)
- Testing commutativity of a group and the power of randomization (Q5169624) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice (Q5874494) (← links)
- Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5918355) (← links)
