672 search results - page 6 / 135 » Almost Optimal Dispersers |
TCC
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
Let n/d ∈ Q, m be a positive integer and let u = n/d mod m. Thus u is the image of a rational number modulo m. The rational reconstruction problem is; given u and m find n/d.
PODS
2000
ACM
14 years 28 days ago
2000
ACM
SODA
2008
ACM
13 years 10 months ago
2008
ACM