Pages that link to "Item:Q1070820"
From MaRDI portal
The following pages link to Computing in general Abelian groups is hard (Q1070820):
Displaying 9 items.
- Collection from the left and other strategies (Q802744) (← links)
- Analysis of algorithms on problems in general abelian groups (Q1062753) (← links)
- Computing a basis for a finite Abelian p-group (Q1074705) (← links)
- On the computational complexity of the Abelian permutation group structure, membership and intersection problems (Q1106934) (← links)
- Generation of finite groups with cyclic Sylow subgroups (Q2218673) (← links)
- Algorithms for computing parameters of graph-based extensions of BCH codes (Q2466021) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- (Q5457530) (← links)
- On the complexity of some problems on groups input as multiplication tables (Q5956010) (← links)