References
- Ausiello , G. , Crescenzi , P. , Gambosi , G. , Kann , V. , Marchetti-Spaccamela , A. and Protasi , M. 1999 . Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties , Springer : Berlin, Heidelberg .
- Bach , E. and Sorenson , J. 1993 . Sieve algorithms for perfect power testing . Algorithmica , 9 : 313 – 328 .
- Benjamin , A. T. and Quinn , J. J. 2003 . Proofs that Really Count: The Art of Combinatorial Proof , DC Washington The Mathematical Association of America
- Caviness , B. 1975 . More on computing roots of integers . ACM SIGSAM Bull. , 9 : 18 – 20 .
- Chandon , O. , LeMaire , J. and Pouget , J. 1978 . Denombrement des quasi-ordres sur un ensemble fini . Math. Sci. , 62 : 61 – 80 .
- Fitch , J. 1974 . A simple method of taking nth roots of integers . ACM SIGSAM Bull. , 8 : 26 – 26 .
- Higginbotham , T. 1993 . The integer square root of n via a binary search . SIGCSE Bull. , 25 : 41 – 47 .
- Matsuura , A. and Nagoya , A. 1997 . Formulation of the addition-shift-sequence problem and its complexity, in Algorithms and Computation , Edited by: Leong , H. , Imai , H. and Jain , S. Vol. 1350 , 42 – 51 . Berlin/Heidelberg : Springer . Lecture Notes in Computer Science
- Rolfe , T. 1987 . On a fast integer square root algorithm . SIGNUM Newslett. , 22 : 6 – 11 .