Untangling upper-bound sieves
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3715682
- scientific article; zbMATH DE number 4116639
- On the lower bound sieve
- Combinatorial sieves of dimension exceeding one
- On the non-linear sieve
- The Bernoulli sieve revisited
- SIEVING AND THE ERDŐS–KAC THEOREM
- On the upper bound of the complexity of sorting
- A new sieve for restricted multiset counting
- The sieving process and lower bounds for the minimum rank problem
Cited in
(3)
This page was built for publication: Untangling upper-bound sieves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874918)