Article contents
Computing in quotients of rings of integers
Published online by Cambridge University Press: 01 August 2014
Abstract
We develop algorithms to turn quotients of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and their behavior under certain quotients. We illustrate the power of our ideas in a new modular normal form algorithm for modules over rings of integers, vastly outperforming classical algorithms.
- Type
- Research Article
- Information
- LMS Journal of Computation and Mathematics , Volume 17 , Special Issue A: Algorithmic Number Theory Symposium XI , 2014 , pp. 349 - 365
- Copyright
- © The Author(s) 2014
References
- 3
- Cited by