Knapsack problem can be solved by Dynamic Programming, which looks like to be solved in polynomial time. However, it is

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: 899603
Joined: Mon Aug 02, 2021 8:13 am

Knapsack problem can be solved by Dynamic Programming, which looks like to be solved in polynomial time. However, it is

Post by answerhappygod »

Knapsack problem can be solved by Dynamic Programming, which
looks like to be solved in polynomial time. However, it is weird if
the Knapsack problem is solved in polynomial time, since it is
NP-Complete.
Point a logical fault in this discussion.
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”