Understanding NP-Complete Problems: Polynomial Reductions & Complexity Theory 🔍
Learn how polynomial time reductions define NP-complete problems and explore key concepts in complexity theory with clear examples and explanations.
Chris Marriott - Computer Science
1.1K views • Jun 3, 2020
About this video
In this video I define a polynomial time reduction and use it to define the class of NP-complete problems. We also take a look at a simple reduction between clique and independent set.
Video Information
Views
1.1K
Likes
17
Duration
53:01
Published
Jun 3, 2020
User Reviews
4.5
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.