16. Complexity: P, NP, NP-completeness, Reductions 16. Complexity: P, NP, NP-completeness, Reductions begin-post-stats MIT OpenCourseWare • 65K views end-post-stats begin-duration 1:25:25 end-duration Math topics: _Mathematical_optimization_##Mathematical optimization##_NP-completeness_##NP-completeness##_Matching_(graph_theory)_##Matching (graph theory)##_Subset_sum_problem_##Subset sum problem##_Algorithms_##Algorithms##_Reduction_(complexity)_##Reduction (complexity)##_Algorithm_##Algorithm##_Polynomial_##Polynomial##_Set_theory_##Set theory##_Partition_of_a_set_##Partition of a set##_Subset_##Subset##_Element_(mathematics)_##Element (mathematics)##_Integers_##Integers##_1_(number)_##1 (number)##_Integer_##Integer##_Negation_##Negation##_Elementary_arithmetic_##Elementary arithmetic##_Addition_##Addition##_Binary_number_##Binary number##_Division_(mathematics)_##Division (mathematics) Other topics: _Complexity_classes_##Complexity classes##_NP_(complexity)_##NP (complexity)##_P_(complexity)_##P (complexity)##_NP-hardness_##NP-hardness##_Complex_systems_theory_##Complex systems theory##_Nondeterministic_algorithm_##Nondeterministic algorithm##_Time_complexity_##Time complexity##_Dynamic_programming_##Dynamic programming##_Logic_##Logic##_Truth_value_##Truth value##_Satisfiability_##Satisfiability##_Truth_##Truth video-id: eHZifpgyH_4 channel_MIT_OpenCourseWare_ So What Learning Algorithms , Complex systems theory , Complexity classes , Elementary arithmetic , Integers , Logic , Mathematical optimization , Set theory Monday, January 22, 2018 Share Share