Understanding P, NP, NP-Hard, and NP-Complete Problems with Reductions
This video explains the definitions of P, NP, NP-Hard, and NP-Complete problems, along with the concept of reductions and their relation to the polynomial class.
Amit G. Maru
28.8K views • Nov 12, 2020
About this video
P, NP, NP Hard and NP Complete Problem | Reduction | NP Hard and NP Compete | Polynomial Class
In this video I have covered following points:
- Definition of P Class and NP Class
- Classification of Algorithm based on time complexity
- Detailed explanation of Non-deterministic Polynomial Algorithm
- Example of Polynomial and Exponential time Algorithm
- NP Hard Problem
- NP Complete Problem
- Venn diagram of P, NP, NP Hard and NP Complete
#Reduction
#NP-Hard
#NP-Complete
#P-Class
#NP-Class
#ExponentialTimeAlgorithm
In this video I have covered following points:
- Definition of P Class and NP Class
- Classification of Algorithm based on time complexity
- Detailed explanation of Non-deterministic Polynomial Algorithm
- Example of Polynomial and Exponential time Algorithm
- NP Hard Problem
- NP Complete Problem
- Venn diagram of P, NP, NP Hard and NP Complete
#Reduction
#NP-Hard
#NP-Complete
#P-Class
#NP-Class
#ExponentialTimeAlgorithm
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
28.8K
Likes
525
Duration
24:44
Published
Nov 12, 2020
User Reviews
4.6
(5) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now