Huge Polynomial Time Victory
TCS researchers when they come up with a O(n⁷²⁶⁴⁹g⁷²(n)) algorithm but at least they show that the problem is in P
Researchers celebrate energetically at a party after finding an algorithm with an absurdly large polynomial running time. The joke is that despite the impractical exponent, proving the problem is in P is still a major theoretical-computer-science result.
older man dancing / пожилой мужчина танцуетyoung man dancing / молодой мужчина танцуетpeople / людиwhite dress shirt / белая рубашкаblue T-shirt / синяя футболкаblack tie / чёрный галстукblack trousers / чёрные брюкиgray sneakers / серые кроссовкиwooden dance floor / деревянный танцполchairs / стульяparty hall / банкетный зал
- @dev_meme / 7769 2026-02-27
- Type
- image
- Size
- 591×599 · 47.9 KiB
- Mood
- triumphant absurd
- Language
- en
- Added