Sciweavers

MOC
1998
73views more  MOC 1998»
14 years 8 days ago
Detecting perfect powers in essentially linear time
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 ...
Daniel J. Bernstein