Pages that link to "Item:Q2643019"

The following pages link to Linear time algorithms for Abelian group isomorphism and related problems (Q2643019):

Displaying 16 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)
• An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism (Q1816737) (← 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)
• Linear Diophantine Equations, Group CSPs, and Graph Isomorphism (Q4575758) (← links)
• Testing commutativity of a group and the power of randomization (Q5169624) (← links)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191525) (← 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)
• Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
• Linear space data structures for finite groups with constant query-time (Q6547214) (← links)