COS 522 No Pass/D/Fail
Introduction to research in computational complexity theory. Computational models: nondeterministic, alternating, and probabilistic machines. Boolean circuits. Complexity classes associated with these models: NP, Polynomial hierarchy, BPP, P/poly, etc. Complete problems. Interactive proof systems and probabilistically checkable proofs: IP=PSPACE and NP=PCP (log n, l). Definitions of randomness. Pseudorandomness and derandomizations. Lower bounds for concrete models such as algebraic decision trees, bounded-depth circuits, and monotone circuits.
Not Open to Freshmen.
Prerequisites and Restrictions:
|23809||L01||3:00 pm - 4:20 pm||T Th||Computer Science Building 302||Enrolled:11 Limit:30|