4. SAT I

4. SAT I

begin-post-stats

MIT OpenCourseWare • 9K views

end-post-stats begin-duration 1:20:32 end-duration
Math topics:
_Boolean_algebra_##Boolean algebra##_Boolean_algebra_##Boolean algebra##_Boolean_satisfiability_problem_##Boolean satisfiability problem##_False_(logic)_##False (logic)##_Algebra_##Algebra##_Variable_(mathematics)_##Variable (mathematics)##_Gaussian_elimination_##Gaussian elimination##_Polynomial_##Polynomial##_Normal_forms_(logic)_##Normal forms (logic)##_Horn_clause_##Horn clause##_Disjunctive_normal_form_##Disjunctive normal form##_Conjunctive_normal_form_##Conjunctive normal form##_Graph_theory_##Graph theory##_Vertex_(graph_theory)_##Vertex (graph theory)##_Directed_acyclic_graph_##Directed acyclic graph##_Graph_(discrete_mathematics)_##Graph (discrete mathematics)##_Matching_(graph_theory)_##Matching (graph theory)
Other topics:
_Complexity_classes_##Complexity classes##_PSPACE-complete_##PSPACE-complete##_NP-completeness_##NP-completeness##_NP-hardness_##NP-hardness##_Computational_complexity_theory_##Computational complexity theory##_2-satisfiability_##2-satisfiability##_Decision_problem_##Decision problem##_Time_complexity_##Time complexity##_Horn-satisfiability_##Horn-satisfiability##_Graph_families_##Graph families##_Bipartite_graph_##Bipartite graph##_Cubic_graph_##Cubic graph##_Planar_graph_##Planar graph##_Propositions_##Propositions##_Propositional_calculus_##Propositional calculus##_Truth_value_##Truth value##_Material_conditional_##Material conditional
video-id: x-Ik9YAFAPo channel_MIT_OpenCourseWare_