CS Degree Day 61

What I did today?

• Lecture 7: NP-completeness - P, NP, polynomial reductions
• Lecture 8: NP-complete problems - 3-SAT, clique, vertex cover

P vs NP. Finally we meet. I have been waiting for this day since the start. It might be the reason I took up studying computer science.