Algorithmic, or Computational, Number Theory studies algorithms for performing number theoretic calculations such as highest common factor, factorisation or testing for primality. Factoring@ (60) Primality Tests@ (22) 1. Suggested Readings in Algorithmic Number Theory - Provided by the organizers of the MSRI Fall 2000 research program. 2. Algorithm Design Manual - Number Theoretic Algorithms - A chapter from "The Algorithm Design Manual" by Steven S. Skiena. 3. Algorithmic Number Theory - Notes by Al Sethuraman. 4. Basics of Computational Number Theory - Notes and Javascript illustrations by Robert Campbell. 5. Computational Number Theory - Lecture notes by Robert Campbell, December 1997. 6. Computational Projects in Number Theory - Interesting problems, usually requiring extensive verifications or enumerations, to occupy the idle CPU time of workstations and personal computers. Compiled by Tomás Oliveira e Silva. 7. Future Directions in Algorithmic Number Theory - Some of the conjectures and open problems motivated by the "PRIMES is in P" papers, compiled at the AIM. 8. Implementations of Extended LLL - Links and notes by Wilberd van der Kallen. 9. LLL Page - Maintained by Keith Matthews. Papers, examples, pseudocode. 10. Some Number Records - Connected with divisibility and factoring. 11. The LLL Algorithm - Papers on the LLL algorithm and its applications collected by François Koeune. 12. Visible Euclidean Algorithm - Enter two positive integers, and click the button to see the operations of the Euclidean Algorithm.

Help build the largest human-edited directory on the web. Submit a Site - Update a Site - Open Directory Project - Become an Editor

© 2008 Chamas Enterprises Inc.