Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > ON-LINE LEARNING ALGORITHM:
Reports tagged with on-line learning algorithm:
TR11-038 | 10th March 2011
Jiapeng Zhang

On the query complexity for Showing Dense Model

A theorem of Green, Tao, and Ziegler can be stated as follows: if $R$ is a pseudorandom distribution, and $D$ is a dense distribution of $R,$ then $D$ can be modeled as a distribution $M$ which is dense in uniform distribution such that $D$ and $M$ are indistinguishable. The reduction ... more >>>




ISSN 1433-8092 | Imprint