Abstract
An efficient algorithm for computing S-maximal orders and maximal orders in Artin–Schreier–Witt extensions of global function fields from pseudo bases is described. The running time of our algorithm is compared to that of Round 2 and Fraatz (2005). This completes our work on efficiently computing maximal orders in cyclic extensions of global function fields.
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.
