NP-COMPLETE PROBLEMS
Set Covering
Decision-Problem Version
Hard Problem
SAT
Hardness of Set Cover
Fine Points
Graph Coloring
Solving 3-colorability
Reduction
Colorability Complexity for Planar Graphs
Next:
Set Covering
Up:
Complexity (23)
Previous:
NP-Completeness
