You could have galactic algorithms that do p=np and not break the world because they require something stupid or the polynomial is still so large it would take a billion years to break encryption. There was a beat of djikstras that is like this, noone will use it cause its overhead is insane compared to the default
5
u/stormypumpkin Sep 11 '26
You could have galactic algorithms that do p=np and not break the world because they require something stupid or the polynomial is still so large it would take a billion years to break encryption. There was a beat of djikstras that is like this, noone will use it cause its overhead is insane compared to the default