8 ms·
That's just NP though. NP-hard means that if you have an algorithm that runs in NP to an HP-hard, you can solve all of them (with a polynomial-time transformati
by fryguy 11y ago
That's just NP though. NP-hard means that if you have an algorithm that runs in NP to an HP-hard, you can solve all of them (with a polynomial-time transformation).