Abstract
Algorithms on abelian groups represented by an explicit set of generators are presented here. An algorithm for computing a set of defining relations and an algorithm for computing a complete basis of an abelian group are given. Also an algorithm for computing a basis for the (abelian) intersection of two abelian groups is given. All algorithms have worst-case time complexity polynomial in terms of the order of the group.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
