P and NP Class Problem and Polynomial Time Solvable (English+Hindi)

P and NP Class Problem and Polynomial Time Solvable (English+Hindi)

begin-post-stats

University Academy- Formerly-IP University CSE/IT • 48K views

end-post-stats begin-duration 9:07 end-duration
Math topics:
_Theoretical_computer_science_##Theoretical computer science##_P_versus_NP_problem_##P versus NP problem##_Nondeterministic_algorithm_##Nondeterministic algorithm##_Computational_problem_##Computational problem
Other topics:
_Complexity_classes_##Complexity classes##_Sharp-P-complete_##Sharp-P-complete##_NP-hardness_##NP-hardness##_NP_(complexity)_##NP (complexity)##_Computational_complexity_theory_##Computational complexity theory##_Decision_problem_##Decision problem##_Computational_complexity_theory_##Computational complexity theory##_Time_complexity_##Time complexity##_Cobham's_thesis_##Cobham's thesis##_Deterministic_algorithm_##Deterministic algorithm##_Polynomial-time_reduction_##Polynomial-time reduction##_Search_algorithms_##Search algorithms##_Knapsack_problem_##Knapsack problem##_Linear_search_##Linear search##_Search_algorithm_##Search algorithm
video-id: ZSyZozw6JMQ channel_University_Academy-_Formerly-IP_University_CSE/IT_