39 search results - page 1 / 8 » Evasiveness and the Distribution of Prime Numbers |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
IPL
2008
13 years 4 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...
MOC
2002
13 years 4 months ago
2002
Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of
CORR
2007
Springer
13 years 4 months ago
2007
Springer
HPCA
2004
IEEE
14 years 5 months ago
2004
IEEE
Using alternative cache indexing/hashing functions is a popular technique to reduce conflict misses by achieving a more uniform cache access distribution across the sets in the ca...