Perfect power testing

DOI10.1016/0020-0190(96)00042-7zbMath0900.68260OpenAlexW2017595464MaRDI QIDQ1350193

R. Balasubramanian, Santosh V. Nagaraj

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00042-7

zbMATH Keywords

Analysis of algorithmsNumber theoretic algorithmsPerfect powers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

Detecting square numbers

Cites Work

• On a problem of Oppenheim concerning Factorisatio Numerorum
• Integers without large prime factors
• Sieve algorithms for perfect power testing
• Fast multiplication of large numbers
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect power testing