lec9 - CS151 Complexity Theory Lecture 9 April 26, 2011...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
CS151 Complexity Theory Lecture 9 April 26, 2011
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 26, 2011 2 Derandomization Goal : try to simulate BPP in subexponential time (or better) use Pseudo-Random Generator (PRG): often: PRG “good” if it passes (ad-hoc) statistical tests seed output string G t bits m  b its
Background image of page 2
April 26, 2011 3 Derandomization ad-hoc tests not good enough to prove BPP has non-trivial simulations Our requirements: G is efficiently computable stretches t bits into m bits fools ” small circuits: for all circuits C of size at most s : |Pr y [C(y) = 1] – Pr z [C(G(z)) = 1]| ≤ ε
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 26, 2011 4 Simulating BPP using PRGs Recall: L BPP implies exists p.p.t.TM M x L Pr y [M(x,y) accepts] ≥ 2/3 x L Pr y [M(x,y) rejects] ≥ 2/3 given an input x: convert M into circuit C(x, y) simplification: pad y so that |C| = |y| = m hardwire input x to get circuit C x Pr y [C x (y) = 1] ≥ 2/3 (“yes”) Pr y [C x (y) = 1] ≤ 1/3 (“no”)
Background image of page 4
April 26, 2011 5 Simulating BPP using PRGs Use a PRG G with output length m seed length t « m error ε < 1/6 fooling size s = m • Compute Pr z [C x (G(z)) = 1] exactly – evaluate C x (G(z)) on every seed z {0,1} t running time (O(m)+(time for G)) 2 t
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 26, 2011 6 Simulating BPP using PRGs knowing Pr z [C x (G(z)) = 1] , can distinguish between two cases: 0 1/3 1/2 2/3 1 “yes”: ε 0 1/3 1/2 2/3 1 “no”: ε
Background image of page 6
April 26, 2011 7 Hardness vs. randomness We have shown: If one-way permutations exist then BPP δ>0 TIME(2 n δ ) ( EXP simulation is better than brute force, but just barely stronger assumptions on difficulty of inverting OWF lead to better simulations…
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 26, 2011 8 Hardness vs. randomness We will show: If E requires exponential size circuits then BPP = P by building a different generator from different assumptions. E = k DTIME(2 kn )
Background image of page 8
April 26, 2011 9 Hardness vs. randomness BMY: for every δ > 0, G δ is a PRG with seed length t = m δ output length m error ε < 1/m d (all d) fooling size s = m e (all e) running time m c running time of simulation dominated by 2 t
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10 Hardness vs. randomness To get BPP = P , would need t = O(log m) BMY building block is one-way- permutation: f:{0,1} t → {0,1} t required to fool circuits of size m e (all e) with these settings a circuit has time to invert f by brute force! can’t get BPP = P with this type of PRG
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 01/05/2012.

Page1 / 41

lec9 - CS151 Complexity Theory Lecture 9 April 26, 2011...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online