Detecting perfect powers in almost linear time
Book information
Description
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect power or proves that n is not a perfect power; (3) proves, using Loxton's theorem on multiple linear forms in logarithms.
Similar books
Post-Quantum Cryptography
2008 · PDF
The Multiple-Lattice Number Field Sieve
1991 · PS
Introduction to Inverse Problems in Imaging
1998 · PS
A Topology Primer
PS
Moduli spaces in algebraic geometry: an Introduction (uncompleted preliminary version)
PS
Introduction to Intersection Theory (preliminary version, July 2007)
2007 · PS
Algebra I
2002 · PS
Simplified Introduction To LaTeX
PS