On The Complexity of Circuit Satisfiability

Video of this lecture
COMPUTER SCIENCE/DISCRETE MATH I
Topic:On The Complexity of Circuit Satisfiability
Speaker:Ramamohan Paturi
Affiliation:University of California at San Diego
Date:Monday, October 12
Time/Room:11:15am - 12:15pm/S-101

http://math.ias.edu/files/seminars/Paturi.pdf