A course in computational algebraic number theory
A course in computational algebraic number theory
Computational Aspects of NUCOMP
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Computational Aspects of NUCOMP
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
| Hi-index | 0.00 |
This note is a detailed explanation of Shanks-Atkin NUCOMP-- composition and reduction carried out "simultaneously"--for all quadratic fields, that is, including real quadratic fields. That explanation incidentally deals with various "exercises" left for confirmation by the reader in standard texts. Extensive testing in both the numerical and function field cases by Michael J Jacobson, Jr, reported elsewhere, confirms that NUCOMP as here described is in fact efficient for composition both of indefinite and of definite forms once the parameters are large enough to compensate for NUCOMP's extra overhead. In the numerical indefinite case that efficiency is a near doubling in speed already exhibited for discriminants as small as 107.