Computations of irregular primes and associated cyclotomic invariants were extended to all primes up to 12 million using multisectioning/convolution methods and a novel approach which originated in the study of Stickelberger codes Shokrollahi (1996). The latter idea reduces the problem to that of finding zeros of a polynomial overFpof degree
CITATION STYLE
Buhler, J., Crandall, R., Ernvall, R., Metsänkylä, T., & Shokrollahi, M. A. (2001). Irregular Primes and Cyclotomic Invariants to 12 Million. Journal of Symbolic Computation, 31(1–2), 89–96. https://doi.org/10.1006/jsco.1999.1011
Mendeley helps you to discover research relevant for your work.