3 ms·
And if P = NP any problem will be NP-hard. Until P ≠ NP is proved we can't heavily rely on the consequences.
by dandanua 3y ago
And if P = NP any problem will be NP-hard. Until P ≠ NP is proved we can't heavily rely on the consequences.
- tgv 3y agoThat's an exaggeration. It's pretty safe to assume P ≠ NP, in practice. In theory you'd have to be more careful, but people have relied on weaker assumptions in math proofs. But for statements about super-mario, it's more than reasonable to assume.