Pages that link to "Item:Q553345"

The following pages link to Linear and sublinear time algorithms for the basis of abelian groups (Q553345):

Displaying 9 items.

• Analysis of algorithms on problems in general abelian groups (Q1062753) (← 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)
• Efficient algorithms for the basis of finite abelian groups (Q2905283) (← links)
• An Algorithm for Computing a Basis of a Finite Abelian Group (Q3014939) (← links)
• Polynomial-time algorithms for finding elements of prime order and sylow subgroups (Q3741775) (← links)
• (Q4335303) (← links)
• Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5918355) (← links)