778 search results - page 2 / 156 » Bounding Smooth Integers |
DCG
2007
13 years 7 months ago
2007
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper deals with products of moderate-size primes, familiarly known as smooth numbers. Smooth numbers play an crucial role in information theory, signal processing and crypto...
PODC
1993
ACM
13 years 11 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
RIVF
2008
13 years 9 months ago
2008
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()
IPL
2008
13 years 7 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...