The following pages link to (Q4228737):
Displaying 9 items.
- Algorithms for polycyclic-by-finite groups (Q507137) (← links)
- Algorithmically finite groups. (Q640937) (← links)
- Analysis of algorithms on problems in general abelian groups (Q1062753) (← links)
- Computing in general Abelian groups is hard (Q1070820) (← links)
- The Pohlig-Hellman method generalized for group structure computation (Q1300626) (← 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)
- (Q3338213) (← links)
- On the complexity of computation in finite Abelian, nilpotent and soluble groups (Q4303909) (← links)
