Computational number theory
From Infogalactic: the planetary knowledge core
In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations.
See also
- Computational complexity of mathematical operations
- Sage Math
- Number Theory Library
- PARI/GP
- Fast Library for Number Theory
Further reading
- Eric Bach and Jeffrey Shallit, Algorithmic Number Theory, volume 1: Efficient Algorithms. MIT Press, 1996, ISBN 0-262-02405-5
- Lua error in package.lua at line 80: module 'strict' not found.
- Henri Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics 138, Springer-Verlag, 1993.
- Richard Crandall and Carl Pomerance, Prime Numbers: A Computational Perspective, Springer-Verlag, 2001, ISBN 0-387-94777-9
- Lua error in package.lua at line 80: module 'strict' not found.
- Victor Shoup, A Computational Introduction to Number Theory and Algebra. Cambridge, 2005, ISBN 0-521-85154-8
<templatestyles src="Asbox/styles.css"></templatestyles>