Lower Bound Sieve

A Lower Bound Sieve is a combinatorial sieve method that provides a lower estimate for the size of a sifted set of integers by constructing a sequence of weights that minimize overcounting while satisfying certain local density conditions.

4

Publications

256

Citations

10

Authors

7

Institutions

Publications per year

2017–2026

0

Authors

10

  1. NB
    Nigel Boston

    University of Wisconsin–Madison, United States

    1 publications · 43 citations

    1

    h-index

  2. TF
    Tuval Foguel

    Chengdu University of Information Technology, China

    1 publications · 43 citations

    1

    h-index

  3. JL
    J. L. Leavitt

    University of Illinois Urbana-Champaign, United States

    1 publications · 43 citations

    1

    h-index

  4. RH
    Roman Holowinsky

    The Ohio State University, United States

    1 publications · 43 citations

    1

    h-index

  5. DT
    David T. Ose

    University of Illinois Urbana-Champaign, United States

    1 publications · 43 citations

    1

    h-index

1–5 of 10

Venues

  1. Choice Reviews Online

    CRO · 1 publications · 117 citations

    1

    h-index

  2. Duke Mathematical Journal

    DMJ · 1 publications · 43 citations

    1

    h-index

  3. Science China Mathematics

    1 publications · 53 citations

    1

    h-index

  4. Communications in Algebra

    1 publications · 43 citations

    1

    h-index

1–4