Video
Unknown · 0:00
2-SAT is solvable in linear time via an implication graph and strongly connected components, but Max-2-SAT is as hard as 3-SAT. The lecture shows that dropping from three literals per clause to two makes exact satisfi...
Unknown · 0:00
2-SAT is solvable in linear time via an implication graph and strongly connected components, but Max-2-SAT is as hard as 3-SAT. The lecture shows that dropping from three literals per clause to two makes exact satisfi...
Redirecting...