openmic.social is an uncensored community. You may encounter strong language, controversial opinions, and mature or NSFW material. You must be 18+ to browse. Illegal content is prohibited and removed on sight — please report it. By continuing, you accept that you may see content you personally disagree with.
I don’t care who you want to get in the weeds with or what you wish to spar about, you’re just not correct.
There is no almost NP complete. There are strong and weak variants, sure, and those have particular implications.
But you’re drawing conclusions that don’t exist from definitions that you clearly don’t understand.
Signed: Somebody who has taught theory of computation for over a decade.
If you want to be pedantic, fine. Integer factoring is not in P. Therefore the math used to encrypt RSA is not in P. The usage of integer factoring to encrypt therefore means it can’t be decrypted in P using brute force. That’s the point I’m making.
We actually don’t know if integer factorization is not in P, though.
Right now, I think most of us would guess that it is a prime candidate for NP Intermediate. Hence why I mentioned it earlier.
And you absolutely can solve it in polynomial time just not with classical architectures.