Events Tagged: "graph problems"

Stephen Cook proves SAT is NP-complete, with implications for graph coloring and other problems