Poly-logarithmic Independence Fools Bounded-Depth Boolean Circuits.

The article discusses forms of mathematical randomness and their detection by algorithms, aspects of which reportedly underlie the modern theory of computer science. The authors present their progress on isolating random sequences that escape detection by algorithms. Aspects of bounded-depth circuit...

Descripción completa

Detalles Bibliográficos

Publicado en:	Communications of the ACM Vol. 54; no. 4; pp. 108 - 116
Autor principal:	Braverman, Mark
Formato:	Artículo
Publicado:	Association for Computing Machinery Apr2011
Materias:	Random numbers Algorithm research Mathematics research Logarithms Boolean algebra Computer science research
Acceso en línea:	Ver este registro en EBSCOhost