R23. Computational Complexity R23. Computational Complexity begin-post-stats MIT OpenCourseWare • 21K views end-post-stats begin-duration 47:14 end-duration Math topics: _Boolean_algebra_##Boolean algebra##_Boolean_function_##Boolean function##_Boolean_algebra_##Boolean algebra##_Boolean_satisfiability_problem_##Boolean satisfiability problem Other topics: _Complexity_classes_##Complexity classes##_NP-completeness_##NP-completeness##_NP_(complexity)_##NP (complexity)##_P_(complexity)_##P (complexity)##_Computational_complexity_theory_##Computational complexity theory##_Analysis_of_algorithms_##Analysis of algorithms##_Computational_complexity_theory_##Computational complexity theory##_Time_complexity_##Time complexity##_Computability_theory_##Computability theory##_Undecidable_problem_##Undecidable problem##_Decision_problem_##Decision problem##_Halting_problem_##Halting problem##_Mathematical_logic_##Mathematical logic##_2-satisfiability_##2-satisfiability##_Class_(set_theory)_##Class (set theory)##_Algorithm_##Algorithm video-id: t5Wxk96QjUk channel_MIT_OpenCourseWare_ So What Learning Boolean algebra , Complexity classes , Computability theory , Computational complexity theory , Mathematical logic Monday, January 22, 2018 Share Share
