Home → Magazine Archive → April 2011 (Vol. 54, No. 4) → Poly-Logarithmic Independence Fools Bounded-Depth... → Abstract

Poly-Logarithmic Independence Fools Bounded-Depth Boolean Circuits

By Mark Braverman

Communications of the ACM, Vol. 54 No. 4, Pages 108-115

[article image]

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.

The full text of this article is premium content


No entries found