Fast Bounds on the Distribution of Smooth Numbers

Scott T. Parsell, Jonathan P. Sorenson

    Research output: Contribution to journalArticlepeer-review

    Abstract

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

    Original languageAmerican English
    JournalScholarship and Professional Work - LAS
    DOIs
    StatePublished - Jan 1 2006

    Keywords

    • Bernstein
    • algorithm
    • fast bounds
    • smooth numbers

    Disciplines

    • Computer Sciences
    • Theory and Algorithms

    Cite this