PseudorandomBitsforConstant-DepthCircuits.pptVIP

Pseudorandom Bitsfor Constant-Depth Circuitswith Few Arbitrary Symmetric Gates Emanuele Viola Harvard University April 2005 Pseudorandom Generator (PRG) [BM,Y,NW] Efficiently Computable Big Stretch s(n) à n ( e.g. s(n) = n?(1) ) Fools small circuits: 8 small C PrX, |X| = s(n)[C(X) = 1] ? Pr?, |?| = n [C(PRG(s)) = 1] Do PRG Exist? PRG ) derandomization: BP ￠ P ( EXP [Y,NW,…] PRG , circuit lower bounds: EXP ? P/poly [NW,BFNW,STV,SU,…] Open Problem: PRG exist? This Work: study restricted PRG Only fool constant-depth circuits We know lower bounds for constant-depth circuits PRG that fools constant-depth circuits Constant-depth circuit = PRG that fools constant-depth circuit As before, but only fools small constant-depth circuit C PrX, |X| = s(n)[C(X) = 1] ? Pr?, |?| = n [C(PRG(s)) = 1] Previous Results [N’91] PRG : {0,1}n ! {0,1}s(n) s(n) = 2n? , fools AC0 = Applications: BP ￠ AC0 ( EXP, more in [NW,HVV,V] [LVW’93] PRG : {0,1}n ! {0,1}s(n) s(n) = n? log n, fools SYM ○ AND = SYM = arbitrary symmetric gate E.g., SYM = PARITY, MAJORITY Our Results Theorem[This Work]: PRG : {0,1}n ! {0,1}s(n) with s(n) = n? log n fools AC0 with ?log2n SYM = Improves on [LVW93] Fools richer class than [N91] but worse stretch BP ￠ (AC0 with few SYM) ( EXP Currently richest BP ￠ class one can derandomize The Pseudorandom Generator [NW] style Input = 1101010101110110101110 Output = 101010 …........1 ……….....1010100 f = ? = PARITY [RW] Outline Why previous results/techniques do not suffice For PRG need new average-case lower bound for AC0 with few SYM Proof sketch of average-case lower bound Known Lower Bounds Recall AC0 with ?log2n SYM = [H,BNS,HG,RW,HM,CH]: f 2 P that requires AC0 circuits with ?log2n SYM of size n?log n Often, lower bound ) PRG. But NOT this time! Standard Approach Standard Approach Fails Our vs. Previous Lower Bounds C = AC0 with few SYM Tools Random