Some remarks on computing the square parts of integers

DOI10.1016/0890-5401(88)90028-4zbMath0661.10007OpenAlexW1991495399MaRDI QIDQ1112857

Susan Landau

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90028-4

zbMATH Keywords

complexityarithmetical functionsEuler's functionfactoringcomputational number theoryCarmichael's functionpolynomial time Turing reduciblesquare part

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic functions; related numbers; inversion formulas (11A25) Primes (11A41)

Related Items (6)

The Power of Leibniz-Like Functions as Oracles ⋮ New Characterization of the Factor Refinement Algorithm with Applications ⋮ Deterministic factoring with oracles ⋮ A deterministic version of Pollard’s $p-1$ algorithm ⋮ Integer factoring and compositeness witnesses ⋮ Approximating rings of integers in number fields

Cites Work

• Reductions among number theoretic problems
• Riemann's hypothesis and tests for primality
• Sums of Divisors, Perfect Numbers and Factoring

This page was built for publication: Some remarks on computing the square parts of integers