COCO
2008
Springer
13 years 6 months ago
2008
Springer
COCO
2008
Springer
13 years 6 months ago
2008
Springer
COCO
2008
Springer
13 years 6 months ago
2008
Springer
COCO
2008
Springer
13 years 6 months ago
2008
Springer
We prove that the sum of d small-bias generators L : Fs Fn fools degree-d polynomials in n variables over a field F, for any fixed degree d and field F, including F = F2 = {0, 1}...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
13 years 6 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant
COCO
2008
Springer
13 years 6 months ago
2008
Springer