Рет қаралды 24,271
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