@inbook{237214c6353445b3b91e8c2bea0058ae,
title = "A fast algorithm for approximately counting smooth numbers",
author = "Sorenson, \{Jonathan P\}",
note = "Part of the Lecture Notes in Computer Science book series (LNCS, volume 1838) Let Ψ( x, y) denote the number of integers ≤ x that are composed entirely of primes bounded by y. We present an algorithm for estimating the value of Ψ( x, y) with a running time roughly proportional to \textbackslash{}(\textbackslash{}sqrt\{y\}\textbackslash{}).",
year = "2000",
doi = "10.1007/10722028\_36",
language = "American English",
booktitle = "Proceedings of the Fourth International Symposium on Algorithmic Number Theory (ANTS-IV)",
}