Question: Show that if P = NP then any problem in P is NP-complete, including the following trivial one: ZERO OR ONE Input: A bit b
Show that if P = NP then any problem in P is NP-complete, including the following trivial one:
ZERO OR ONE
Input: A bit b
Question: Is b = 1?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
