hw9.htm
CS 383
Homework
Here are some problems related to NP-Completeness and reduceability. I am not going to collect these, but you might find that they reinforce the ideas of problem reduction that we are doing in class.
p. 424 #10.1.3, #10.1.5( parts a,b,c)
#10.1.6(parts a, b, c)
p. 434 #10.2.1 (parts a,b)