NP Completeness for dummies: Complexity Classes P and NP (lec 1) NP Completeness for dummies: Complexity Classes P and NP (lec 1) begin-post-stats saurabhschool • 94K views end-post-stats begin-duration 8:30 end-duration Math topics: _Graph_theory_##Graph theory##_Glossary_of_graph_theory_##Glossary of graph theory##_Graph_(discrete_mathematics)_##Graph (discrete mathematics)##_Vertex_(graph_theory)_##Vertex (graph theory) Other topics: _Computational_complexity_theory_##Computational complexity theory##_Time_complexity_##Time complexity##_P_(complexity)_##P (complexity)##_NP_(complexity)_##NP (complexity)##_Structural_complexity_theory_##Structural complexity theory##_P_versus_NP_problem_##P versus NP problem##_NP-completeness_##NP-completeness##_NP-hardness_##NP-hardness video-id: f7U7UK6iiU4 channel_saurabhschool_ So What Learning Computational complexity theory , Graph theory , Structural complexity theory Monday, January 22, 2018 Share Share