NP-complete - Complexity Theory - Design and Analysis of Algorithms

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...

Chris Marriott - Computer Science1.1K views53:01

🔥 Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in Thailand under the topic 'สภาพอากาศ'.

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

Total views since publication

Likes
17

User likes and reactions

Duration
53:01

Video length

Published
Jun 3, 2020

Release date

Quality
hd

Video definition