• Formally define the polynomial time reducibility A ?p B.
• Let A ? NP-Complete and B? NP and A?p B, that is NP-Complete
problem A is reduced to NP problem B in polynomial time. What can
you conclude (if anything at all) from this fact?
• Let A ? NP-Complete and BEP and Ap B, that is NP-Complete
problem A is reduced to P problem B in polynomial time. What can you
conclude (if anything at all) from this fact?
• Let A ? NP-Complete and B? Pand BP A, that is P problem B is
reduced to NP-Complete problem A in polynomial time. What can you
conclude (if anything at all) from this fact?