Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture 40 CSE 331 Dec 7, 2011.

Similar presentations


Presentation on theme: "Lecture 40 CSE 331 Dec 7, 2011."— Presentation transcript:

1 Lecture 40 CSE 331 Dec 7, 2011

2 CSEd week puzzle hunt tomorrow!
Why should you turn up? Kindle touches Know about Research in the dept. Check in prizes Food Ipod Nanos

3 Review Sessions etc. Atri: (at least ½ of) class Friday
Jiun-Jie: Friday, 3:00- 4:30pm (Commons 9) Jesse: Review Session on Mon, Dec 12 (pick time slot on blog) All grades have been uploaded to UBLearns Temp grades hopefully by end of this week

4 Volunteers?

5 P vs NP question P: problems that can be solved by poly time algorithms Is P=NP? NP: problems that have polynomial time verifiable witness to optimal solution

6 I don’t know what I was thinking!
NP P

7 Two scenarios NP P NP Complete NP NP Complete P P=NP

8 Nice survey on P vs. NP

9 Today’s agenda The wondrous worlds of randomization and approximation


Download ppt "Lecture 40 CSE 331 Dec 7, 2011."

Similar presentations


Ads by Google