1401 search results - page 225 / 281 » Randomness in Interactive Proofs |
120
Voted
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
121
Voted
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
116
Voted
AAAI
2006
15 years 4 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
116
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
117
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...