4 ms·
First off, it's a joke explanation and not meant to be taken seriously anyways. But more notably, like Fermat's theorem, we can probably conclude that there's
by jcranmer 5y ago
First off, it's a joke explanation and not meant to be taken seriously anyways.
But more notably, like Fermat's theorem, we can probably conclude that there's no easy quadratic or cubic algorithm for SAT that we've somehow missed. If P = NP, then, the most likely algorithm we'd see would be some hideous combinatorial algorithm that has a constant factor of 3^2^2^4 lurking in it that is completely impractical.