3 ms·
Is there a proof somewhere which states that all NP hard problem can have a similar / generic solution? I find it more likely that the N-Queens problem will ha
by Zarathust 9y ago
Is there a proof somewhere which states that all NP hard problem can have a similar / generic solution?
I find it more likely that the N-Queens problem will have a very specific solution
- pdpi 9y agoProblems in NP hard that are also in NP are known as NP-complete. NP complete problems share the characteristic that all problems in P can be reduced to any NP problem in polynomial time (which is to say: you can encode P problems as particular instances of NP problems). Therefore, if P = NP, all problems in NP are reducible to one another.