|
Home >> Science >> Math >> Number Theory >> Computational |
|
|
Within mathematics, computational number theory is the survey of algorithms for performing number theoretic computations.
A better known condition in the field is integer factorization.
| |
|
Algorithm Design Manual - Number Theoretic Algorithms A chapter from "The Algorithm Design Manual" by Steven S. Skiena. Basics of Computational Number Theory Notes and Javascript illustrations by Robert Campbell. Computational Number Theory Lecture notes by Robert Campbell, December 1997. Implementations of Extended LLL Links and notes by Wilberd van der Kallen. Suggested Readings in Algorithmic Number Theory Provided by the organizers of the MSRI Fall 2000 research program. The LLL Algorithm Papers on the LLL algorithm and its applications collected by François Koeune. 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. Algorithmic Number Theory Notes by Al Sethuraman. Some Number Records Connected with divisibility and factoring. 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. |
|
© 2005 GeneralAnswers.org