Abstract
Nisan [] and Nisan and Wigderson [] have constructed a pseudo-random generator which fools any family of polynomial-size constant depth circuits. At the core of their construction is the result due to Håstad [] that no circuit of depth d and size \( 2^{n^{1/d} } \) can even weakly approximate (to within an inverse exponential factor) the parity function. We give a simpler proof of the inapproximability of parity by constant depth circuits which does not use the Hastad Switching Lemma. Our proof uses a well-known hardness amplification technique from derandomization: the XOR lemma. This appears to be the first use of the XOR lemma to prove an unconditional inapproximability result for an explicit function (in this case parity). In addition, we prove that BPAC0 can be simulated by uniform quasipolynomial size constant depth circuits, improving on results due to Nisan [] and Nisan and Wigderson [].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.