Tuesday, January 27, 2009

Lecture 5

The topics in Lecture 5 were: Why having an algorithm for SAT is different from having an oracle for SAT; the Valiant-Vazirani theorem ("Unique-SAT $\in P \Rightarrow$ SAT $\in RP$"); pairwise-independent hash families; most of the Approximate Counting Theorem.

No comments:

Post a Comment

Note: Only a member of this blog may post a comment.