6 ms·
This is an over simplification, but since the np hard problems are reducible to each other, finding polynomial time solution for one problem will give us polyno
by enitihas 7y ago
This is an over simplification, but since the np hard problems are reducible to each other, finding polynomial time solution for one problem will give us polynomial time solutions for all np hard problems.
- jagraff 7y agoNP complete, not NP hard