8. NP-Hard and NP-Complete Problems

8. NP-Hard and NP-Complete Problems

begin-post-stats

Abdul Bari • 10K views

end-post-stats begin-duration 31:53 end-duration
Math topics:
_Sorting_algorithms_##Sorting algorithms##_Bubble_sort_##Bubble sort##_Merge_sort_##Merge sort##_Sorting_algorithm_##Sorting algorithm
Other topics:
_Computational_complexity_theory_##Computational complexity theory##_Nondeterministic_algorithm_##Nondeterministic algorithm##_Time_complexity_##Time complexity##_Reduction_(complexity)_##Reduction (complexity)##_Computational_problem_##Computational problem##_Deterministic_algorithm_##Deterministic algorithm##_Complexity_classes_##Complexity classes##_NTIME_##NTIME##_NP-hardness_##NP-hardness##_NP_(complexity)_##NP (complexity)##_Sharp-P-complete_##Sharp-P-complete##_Mathematical_logic_##Mathematical logic##_Satisfiability_##Satisfiability##_Well-formed_formula_##Well-formed formula##_Algorithm_##Algorithm##_Metaphysical_theories_##Metaphysical theories##_Truth_##Truth##_Determinism_##Determinism##_Idea_##Idea##_Search_algorithms_##Search algorithms##_Knapsack_problem_##Knapsack problem##_Linear_search_##Linear search##_Search_algorithm_##Search algorithm##_Computational_problems_in_graph_theory_##Computational problems in graph theory##_Hamiltonian_path_##Hamiltonian path##_Minimum_spanning_tree_##Minimum spanning tree##_Graph_coloring_##Graph coloring
video-id: e2cF8a5aAhE channel_Abdul_Bari_