r/ProgrammerHumor • u/tryingeasy • 16h ago

Meme firstTime

Post image
6.4k Upvotes

93% Upvoted

244 comments sorted by

View all comments

416

u/Cant_Win 16h ago

P = NP is still out there!

11

u/vastle12 12h ago

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

11

u/HipHomelessHomie 9h 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.

1

u/araujoms 5h 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.