4 ms·
I've never understood why this problem is considered so difficult. I'm not a fancy schmancy computer scientist but even I can see that N = 1 or P = 0.
by Pikamander2 2y ago
I've never understood why this problem is considered so difficult. I'm not a fancy schmancy computer scientist but even I can see that N = 1 or P = 0.
- deleted 2y ago[deleted]
- HappMacDonald 2y ago> even I can see that N = 1 or P = 0 wat?
- Dylan16807 2y agoIt's a joke, they're doing algebra on the letters.
- acchow 2y agoI would recommend reading the article. P vs NP is one of the foundational open problems in computer science.
- dehrmann 2y agoThey're almost certainly not equal because solving NP in P time requires magically making exponential decisions in P time. What's interesting that it's been so hard to prove one way or the other.
- seanhunter 2y agoI realise you're probably joking but on the off-chance you are not, P and NP are sets containing classes of algorithms. They aren't numbers. See https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pd... for a formal description of the problem.