Sciweavers

Share
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
9 years 5 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
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...
Emanuele Viola
COCO
2005
Springer
96views Algorithms» more  COCO 2005»
9 years 9 months ago
A Geometric Approach to Information-Theoretic Private Information Retrieval
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...
David P. Woodruff, Sergey Yekhanin
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
9 years 9 months ago
New Results on the Complexity of the Middle Bit of Multiplication
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...
Ingo Wegener, Philipp Woelfel
COCO
2005
Springer
68views Algorithms» more  COCO 2005»
9 years 9 months ago
Pseudorandomness for Approximate Counting and Sampling
Ronen Shaltiel, Christopher Umans
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
9 years 9 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
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...
Arfst Nickelsen, Birgit Schelm
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
9 years 9 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
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...
Sophie Laplante, Troy Lee, Mario Szegedy
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
9 years 9 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
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...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
books