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...
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...
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}...
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...
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...