Computational number theory

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. The best known problem in the field is integer factorization.

See also

Further reading








Creative Commons License