Sciweavers

33 search results - page 3 / 7
» coco 2009
Sort
View
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 2 months ago
Parallel Approximation of Non-interactive Zero-sum Quantum Games
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
Rahul Jain, John Watrous
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 2 months ago
Poly-logarithmic Independence Fools AC0 Circuits
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...
Mark Braverman
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
13 years 11 months ago
On the Complexity of Boolean Functions in Different Characteristics
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
Parikshit Gopalan, Shachar Lovett, Amir Shpilka
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
14 years 2 months ago
Are PCPs Inherent in Efficient Arguments?
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
Guy N. Rothblum, Salil P. Vadhan
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 2 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody