Algorithmic, or Computational, Number Theory studies algorithms for performing number theoretic calculations such as highest common factor, factorisation or testing for primality.
Subcategories 2
Related categories 4
Sites 7
Loading new listings for you to review...
- Algorithm Design Manual - Number Theoretic Algorithms A chapter from "The Algorithm Design Manual" by Steven S. Skiena.
- Implementations of Extended LLL Links and notes by Wilberd van der Kallen.
- 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.
- LLL Page Maintained by Keith Matthews. Papers, examples, pseudocode.
- Visible Euclidean Algorithm Enter two positive integers, and click the button to see the operations of the Euclidean Algorithm.
- 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.