Page 1 of 1
Assuming that P NP, if I can use an approximation algorithm to find a solution to an NP-Hard problem that is within a fa
Posted: Sun May 15, 2022 10:06 am
by answerhappygod
- Assuming That P Np If I Can Use An Approximation Algorithm To Find A Solution To An Np Hard Problem That Is Within A Fa 1 (25.02 KiB) Viewed 45 times
Assuming that P NP, if I can use an approximation algorithm to find a solution to an NP-Hard problem that is within a factor of 2 of optimal, then can I use polynomial time reductions to find solutions to all NP-Hard problems within a factor of 2 of optimal? A. Yes B. No C. An unsolved problem: answer is not known