lec18 - CS151 Complexity Theory Lecture 18 May 26, 2011...

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

View Full Document Right Arrow Icon
CS151 Complexity Theory Lecture 18 May 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
May 26, 2011 2 Course Summary
Background image of page 2
May 26, 2011 3 Course summary Time and space hierarchy theorems FVAL in L CVAL P -complete QSAT PSPACE -complete succinct CVAL EXP -complete
Background image of page 3

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

View Full DocumentRight Arrow Icon
May 26, 2011 4 Course summary Non-determinism NTIME hierarchy theorem “NP-intermediate” problems (Ladner’s Theorem) unary languages (likely) not NP-complete Savitch’s Theorem Immerman-Szelepcsényi Theorem Problem sets: sparse languages (likely) not NP-complete
Background image of page 4
May 26, 2011 5 Course summary Non-uniformity formula lower bound (Andreev, Hastad) monotone circuit lower bound (Razborov) Problem sets: Barrington’s Theorem formula lower bound for parity
Background image of page 5

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

View Full DocumentRight Arrow Icon
May 26, 2011 6 Course summary Randomness polynomial identity testing + Schwartz-Zippel unique-SAT (Valiant-Vazirani Theorem) Blum-Micali-Yao PRG Nisan-Wigderson PRG worst-case hardness ) average-case hardness Trevisan extractor Problem sets: Goldreich-Levin hard bit
Background image of page 6
Image of page 7
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 / 17

lec18 - CS151 Complexity Theory Lecture 18 May 26, 2011...

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

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