2012 IEEE 27th Conference on Computational Complexity (2011)

San Jose, California USA

June 8, 2011 to June 11, 2011

ISSN: 1093-0159

ISBN: 978-0-7695-4411-3

pp: 243-251

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2011.11

ABSTRACT

We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound on the statistical distance between (i) the output distribution of any small constant-depth (a.k.a. AC0) circuit, and (ii) the uniform distribution over any code that is ``good'', i.e. has constant relative distance and rate. This seems to be the first lower bound of this kind. We give two simple applications of this result: (1) any data structure for storing codewords of a good code requires an additive logarithmic redundancy, if each bit of the codeword can be retrieved by a small AC0 circuit; (2) for some choice of the underlying combinatorial designs, the output distribution of Nisan's pseudorandom generator against AC0 circuits of depth d cannot be sampled by small AC0 circuits of depth less than d.

INDEX TERMS

Small-depth circuits, sampling distributions, lower bounds

CITATION

Shachar Lovett,
Emanuele Viola,
"Bounded-Depth Circuits Cannot Sample Good Codes",

*2012 IEEE 27th Conference on Computational Complexity*, vol. 00, no. , pp. 243-251, 2011, doi:10.1109/CCC.2011.11