Fast Bounds on the Distribution of Smooth Numbers
Abstract
In this paper we present improvements to Bernstein’s algorithm, which finds rigorous upper and lower bounds for (x, y).
Suggested Citation
S. Parsell and J. Sorenson, Fast Bounds on the Distribution of Smooth Numbers, Proceedings of the 7th International Symposium on Algorithmic Number Theory (ANTS-VII), Florian Hess, Sebastian Pauli, and Michael Pohst eds., Berlin, Germany, pages 168-181, 2006. LNCS 4076, ISBN 3-540-36075-1.