A Generalization of Lehman's Method
From MaRDI portal
Abstract: A new deterministic algorithm for finding square divisors, and finding -power divisors in general, is presented. This algorithm is based on Lehman's method for integer factorization and is straightforward to implement. While the theoretical complexity of the new algorithm is far from best known, the algorithm becomes especially effective if even a loose bound on a square divisor is known. Additionally, we answer a question by D. Harvey and M. Hittmeir on whether their recent deterministic algorithm for integer factorization can be adapted to finding -power divisors.
This page was built for publication: A Generalization of Lehman's Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6412507)
