Fast Bounds on the Distribution of Smooth Numbers

Authors

Scott T. Parsell
Jonathan P. Sorenson, Butler UniversityFollow

Document Type

Conference Proceeding

Publication Date

2006

Publication Title

Proceedings of the 7th International Symposium on Algorithmic Number Theory

First Page

168

Last Page

181

DOI

http://dx.doi.org/10.1007/11792086_13

Abstract

In this paper we present improvements to Bernstein’s algorithm, which finds rigorous upper and lower bounds for (x, y).

Rights

“The final publication is available at Springer via http://dx.doi.org/10.1007/11792086_13”.

Recommended 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.