Diffrentiate between np complete and np hard problem
Answers
Answered by
3
Hello dear....➡️➡️➡️➡️
A problem is NP-hard if any problem in NP can be reduced to it in polynomial time. A problem is NP-complete if any problem in NP can be reduced to it in polynomial time AND it is also in NP(and thus solutions can be verified in polynomial time). ... P - Problems that can be solved in polynomial time.
i hope help u..
A problem is NP-hard if any problem in NP can be reduced to it in polynomial time. A problem is NP-complete if any problem in NP can be reduced to it in polynomial time AND it is also in NP(and thus solutions can be verified in polynomial time). ... P - Problems that can be solved in polynomial time.
i hope help u..
Similar questions