Abstract
We describe in detail the implementation of an algorithm which computes the class group and the unit group of a general number field, and solves the principal ideal problem. The basic ideas of this algorithm are due to J. Buchmann. New ideas are the use of LLL-reduction of an ideal in a given direction which replaces the notion of neighbour, and the use ofcomplexlogarithmic embeddings of elements which plays a crucial role. Heuristically the algorithm performs in sub-exponential time with respect to the discriminant for fixed degree, and performs well in practice.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
