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

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

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

Post 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
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 44 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
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Top
Post Reply

Return to “Archived Questions & Answers”