3208 search results - page 246 / 642 » A Lower Bound for Primality |
187
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
167
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
199
Voted
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
175
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents an efficient approach to perform global interconnect sizing and spacing (GISS) for multiple nets to minimize interconnect delays with consideration of couplin...
144
click to vote
JC
2007
15 years 6 months ago
2007
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup f...