CSE-830

Code and course material for MSU's "CSE 830: Design and Theory of Algorithms"

CSE 830: Design & Theory of Algorithms

Documents for CSE 830 - Week 14

Introduction to P, NP, and NP-Completeness

Starting: 11/30

Videos for Tuesday, Dec 1st

P, NP, and NP-Complete Problems (14:41)

Videos for Thursday, Dec 3rd

Proving NP Completeness (19:57)

Proving that Integer Programming is NP-Complete (9:02)