Detecting perfect powers by factoring into coprimes
From MaRDI portal
(Redirected from Publication:3420437)
Recommendations
- On the Computation of g(k) in Waring's Problem
- Sieve algorithms for perfect power testing
- Perfect power testing
- A characterization of nonprime powers
- Detecting perfect powers in essentially linear time
- Algorithmic Number Theory
- Consecutive integers divisible by the square of their largest prime factors
- On the powerfull part of n^2+1.
Cites work
Cited in
(14)- Power detection over number fields
- New Characterization of the Factor Refinement Algorithm with Applications
- Detecting square numbers
- Factoring into coprimes in essentially linear time
- Detecting perfect powers in essentially linear time
- Primality testing with Gaussian periods
- Efficiently certifying non-integer powers
- A characterization of nonprime powers
- Proving primality in essentially quartic random time
- A generalization of Lehman's method
- On completely factoring any integer efficiently in a single run of an order-finding algorithm
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
- Deterministic factoring with oracles
- A deterministic algorithm for finding \(r\)-power divisors
This page was built for publication: Detecting perfect powers by factoring into coprimes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3420437)
