Sciweavers

30 search results - page 3 / 6
» coco 2008
Sort
View
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
14 years 11 months ago
Towards Dimension Expanders over Finite Fields
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...
Zeev Dvir, Amir Shpilka
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
14 years 11 months ago
Lower Bounds and Separations for Constant Depth Multilinear Circuits
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...
Ran Raz, Amir Yehudayoff
COCO
2008
Springer
72views Algorithms» more  COCO 2008»
14 years 11 months ago
The Sum of d Small-Bias Generators Fools Polynomials of Degree d
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}...
Emanuele Viola
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
14 years 11 months ago
Approximation Resistant Predicates from Pairwise Independence
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
Per Austrin, Elchanan Mossel
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
14 years 11 months ago
The Multiplicative Quantum Adversary
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
Robert Spalek