Beyond Computation: The P vs NP Problem - Michael Sipser Beyond Computation: The P vs NP Problem - Michael Sipser begin-post-stats PoincareDuality • 124K views end-post-stats begin-duration 1:01:38 end-duration Math topics: _Graph_theory_##Graph theory##_Glossary_of_graph_theory_##Glossary of graph theory##_Clique_(graph_theory)_##Clique (graph theory)##_Vertex_(graph_theory)_##Vertex (graph theory)##_Clique_problem_##Clique problem Other topics: _Complexity_classes_##Complexity classes##_NP-completeness_##NP-completeness##_NP_(complexity)_##NP (complexity)##_P_(complexity)_##P (complexity)##_Formal_sciences_##Formal sciences##_Mathematics_##Mathematics##_Logic_##Logic##_Pure_mathematics_##Pure mathematics##_Mathematical_logic_##Mathematical logic##_Proposition_##Proposition##_Mathematical_proof_##Mathematical proof##_Mathematical_logic_##Mathematical logic video-id: msp2y_Y5MLE channel_PoincareDuality_ So What Learning Complexity classes , Formal sciences , Graph theory , Mathematical logic Sunday, January 21, 2018 Share Share
