23. Computational Complexity

23. Computational Complexity

begin-post-stats

MIT OpenCourseWare • 287K views

end-post-stats begin-duration 51:12 end-duration
Math topics:
_Elementary_mathematics_##Elementary mathematics##_1_(number)_##1 (number)##_Natural_number_##Natural number##_Integer_##Integer##_Real_number_##Real number##_Graph_theory_##Graph theory##_Glossary_of_graph_theory_##Glossary of graph theory##_Graph_(discrete_mathematics)_##Graph (discrete mathematics)##_Shortest_path_problem_##Shortest path problem##_Mathematical_terminology_##Mathematical terminology##_Theorem_##Theorem##_Metatheorem_##Metatheorem##_Mathematical_proof_##Mathematical proof
Other topics:
_Complexity_classes_##Complexity classes##_NP-completeness_##NP-completeness##_NP_(complexity)_##NP (complexity)##_NP-hardness_##NP-hardness##_EXPTIME_##EXPTIME##_Computational_complexity_theory_##Computational complexity theory##_Computational_complexity_theory_##Computational complexity theory##_Time_complexity_##Time complexity##_Complexity_class_##Complexity class##_Computational_problems_##Computational problems##_Knapsack_problem_##Knapsack problem##_Decision_problem_##Decision problem##_Tetris_##Tetris##_Computability_theory_##Computability theory##_Undecidable_problem_##Undecidable problem##_Computable_number_##Computable number##_Halting_problem_##Halting problem
video-id: moPtwq_cVH8 channel_MIT_OpenCourseWare_