NP Completeness for Dummies: Vertex Cover Problem is NP complete

begin-post-stats

saurabhschool • 47K views

end-post-stats begin-duration 19:51 end-duration

Math topics:

_Theoretical_computer_science_##Theoretical computer science##_Graph_theory_##Graph theory##_Vertex_(graph_theory)_##Vertex (graph theory)##_Graph_(discrete_mathematics)_##Graph (discrete mathematics)

Other topics:

_Computational_complexity_theory_##Computational complexity theory##_Clique_problem_##Clique problem##_Vertex_cover_##Vertex cover##_P_(complexity)_##P (complexity)

video-id: _dF0FrBLMzM channel_saurabhschool_

So What Learning

Computational complexity theory , Theoretical computer science

Friday, January 19, 2018

• Share