A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems

Computer Science/Discrete Mathematics Seminar II
Topic:A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems
Speaker:Russell Impagliazzo
Affiliation:University of California, San Diego; Member, School of Mathematics
Date:Tuesday, January 24
Time/Room:10:30am - 12:30pm/S-101

<a href="http://math.ias.edu/files/seminars/RussI.pdf">http://math.ias.edu/files/seminars/RussI.pdf</a>