Slide 1CS151 Complexity Theory Lecture 17 May 27, 2004 Slide 2 CS151 Lecture 172 Outline elements of the proof of the PCP Theorem counting problems –#P and its relation…

Slide 1CS151 Complexity Theory Lecture 8 April 22, 2004 Slide 2 CS151 Lecture 82 Derandomization Goal: try to simulate BPP is subexponential time (or better) use Pseudo-Random…

Slide 1 Probabilistic Proof System — An Introduction Deng Yi CCRG@NTU Slide 2 A Basic Question Suppose: You are all-powerful and can do cloud computing (i.e., whenever…

Slide 1 CS151 Complexity Theory Lecture 7 April 20, 2004 Slide 2 CS151 Lecture 72 Outline 3 examples of the power of randomness –communication complexity –polynomial…

Slide 1 CS151 Complexity Theory Lecture 5 April 13, 2004 Slide 2 April 8, 2004CS151 Lecture 42 Introduction Power from an unexpected source? we know P ≠ EXP, which implies…

Slide 1 CS151 Complexity Theory Lecture 11 May 4, 2004 Slide 2 CS151 Lecture 112 Outline Extractors Trevisan’s extractor RL and undirected STCONN Slide 3 May 4, 2004CS151…

Slide 1 CS151 Complexity Theory Lecture 10 April 29, 2004 Slide 2 CS151 Lecture 102 Outline Decoding Reed-Muller codes Transforming worst-case hardness into average-case…

Slide 1 CS151 Complexity Theory Lecture 13 May 11, 2004 Slide 2 CS151 Lecture 132 Outline Natural complete problems for PH and PSPACE proof systems interactive proofs and…

Slide 1 CS151 Complexity Theory Lecture 1 March 30, 2004 Slide 2 CS151 Lecture 12 Complexity Theory Classify problems according to the computational resources required –running…

Slide 1 CS151 Complexity Theory Lecture 15 May 18, 2004 Slide 2 CS151 Lecture 152 Outline IP = PSPACE Arthur-Merlin games –classes MA, AM Optimization, Approximation, and…