Page 1 of 1
Suppose a decision problem IsltGoingToRain is NP-Complete and there exists a polynomial time reduction of IsltGoingToRai
Posted: Sun May 15, 2022 10:04 am
by answerhappygod
- Suppose A Decision Problem Isltgoingtorain Is Np Complete And There Exists A Polynomial Time Reduction Of Isltgoingtorai 1 (36.72 KiB) Viewed 29 times
Suppose a decision problem IsltGoingToRain is NP-Complete and there exists a polynomial time reduction of IsltGoingToRain to the problem IsitGoingToBeSunny. What can we conclude? A. IsltGoingToBeSunny is NP-Hard B. IsitGoingToBeSunny is NP-Complete o C. IsitGoingToBeSunny is in NP O D. IsitGoingToBeSunny is in P E. IsitGoingToBeSunny is in EXP F. None of these.