Poly-Logarithmic Independence Fools Bounded-Depth Boolean Circuits

The question of determining which (weak) forms of randomness "fool" (or seem totally random to) a given algorithm is a basic and fundamental question in the modern theory of computer science. In this work we report progress on this question.