Efficiently certifying non-integer powers

DOI10.1007/S00037-010-0297-XMaRDI QIDQ626685zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mark Lavin, Erich L. Kaltofen

Publication date 18 February 2011

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00037-010-0297-x

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Density theorems (11R45)

Recommendations

• A characterization of nonprime powers
• Detecting perfect powers by factoring into coprimes
• Perfect power testing
• Detecting perfect powers in essentially linear time
• Sieve algorithms for perfect power testing

Cited in

(1)

• A characterization of nonprime powers

This page was built for publication: Efficiently certifying non-integer powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626685)