Question: Finding a polynomial time algorithm to solve the n-queens problem, means that there exsists a polynomial- time algo rithem to solve the knapsack problem. is
Finding a polynomial time algorithm to solve the n-queens problem, means that there exsists a polynomial- time algo rithem to solve the knapsack problem. is this statement ture or false. explain your answer.
b) all the decision problem that are in P are also in NP. is this statement ture, explain your answer
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
