Difference between np hard and np complete optimization
Answers
Answered by
3
Hello dear......i help u..➡️➡️➡️➡️
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). In other words, the set of NP-complete problems is the set formed by the intersection of NP and NP-hard. ... P - Problems that can be solved in polynomial time.
i hope help u...☺☺☺☺
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). In other words, the set of NP-complete problems is the set formed by the intersection of NP and NP-hard. ... P - Problems that can be solved in polynomial time.
i hope help u...☺☺☺☺
Similar questions