Topics covered in Lecture 10:

Barrington's theorem: NC^1 has constant width branching programs (Ben-Or & Cleve's proof which showed width 7)

Lipton-Viglas theorem: SAT can't be solved in simultaneous n^{o(1)} space and n^{1.41} time.

Comments on relativization and limits of diagonalization

Introduction to Interactive proofs

Subscribe to:
Post Comments (Atom)

And problem set 3 was handed out today and is also posted on the course website.

ReplyDelete