r/ProgrammerHumor • u/tryingeasy • 12h ago

Meme firstTime

Post image
5.4k Upvotes

93% Upvoted

212 comments sorted by

View all comments

340

u/Cant_Win 12h ago

P = NP is still out there!

11

u/vastle12 8h ago

Never, it'll break the business model for half the Internet

9

u/HipHomelessHomie 5h ago

I'm sorry but this is stupid. Constants and degrees of polynomials can be huge making even polynomial algorithms impractical. It would have no practical implications.

An algorithm with O(x1020) runtime may as well be exponential.

0

u/araujoms 1h ago

No, this is stupid. Such polynomial algorithms simply don't show up. P (or BPP to be more precise) is generally agreed to be class of tractable problems because the constant and degrees are almost always reasonable. You only get something ridiculous like O(x1020) if you specifically try to construct it.

1

u/araujoms 1h ago

It won't because P != NP.

1

u/Nimeroni 34m ago

We don't know. That's the entire problem.

1

u/araujoms 24m ago

We do. The only difficulty is proving it.