CS 6520 - Computational Complexity Fall 2015
Wednesday, October 14, 2015
Lecture 24
Proof of the Isolation Lemma and its application to show that solving satisfiability on formulas with at most one satisfying assignment implies NP = RP. Details and links in my
blog post
.
Newer Post
Older Post
Home