Page 1 of 1
Suppose problem MinDirectorsCut reduces to MinTheatricalCut in polynomial time, and MinTheatricalCut is NP-Hard. What ca
Posted: Sun May 15, 2022 10:05 am
by answerhappygod
- Suppose Problem Mindirectorscut Reduces To Mintheatricalcut In Polynomial Time And Mintheatricalcut Is Np Hard What Ca 1 (31.49 KiB) Viewed 38 times
Suppose problem MinDirectorsCut reduces to MinTheatricalCut in polynomial time, and MinTheatricalCut is NP-Hard. What can we conclude? A. MinDirectorsCut is NP-Hard B. MinDirectorsCut is NP-Complete C. Min Directors Cut is in NP ОО D. MinDirectorsCut is in P E. Min DirectorsCut is in EXP F. None of these.