COCO
2005
Springer
13 years 6 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...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
COCO
2005
Springer
13 years 10 months ago
2005
Springer
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
COCO
2005
Springer
13 years 10 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
COCO
2005
Springer
13 years 10 months ago
2005
Springer
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...