Question: Consider the following function f: Given a graph G, f decides if there is a 3-coloring of G. If there is, f maps G to
Consider the following function f: Given a graph G, f decides if there is a 3-coloring of G. If there is, f maps G to an instance of EXAM SCHEDULING which contains one class with one student, where J = 1. If there isn't, f maps G to an instance of EXAM SCHEDULING where J = 1 and there are two classes all containing the same set of students. What is the best reason why f is not a polynomial time reduction of 3-COLOR to EXAM SCHEDULING? a) If P NP, f is not a polynomial time function b) A graph which is not 3-colorable may be mapped to a Yes instance of EXAM SCHEDULING c) A graph which is 3-colorable may be mapped to a No instance of EXAM SCHEDULING d) f is not 1-1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
