View Single Post
Old 2021-05-30, 23:40   #6
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

33·233 Posts
Default

Proving P=NP in no way guarantees you can then find P algorithms for all NP problems. Maybe you could, maybe you couldn't. It depends upon the nature of the proof.

All it would say is that an algorithm exists. It might not say how to find it.

It is even possible that someone could prove P=NP, but still no one can find any algorithm to solve any NP problem in P time.

You appear to have the opposite. You have an NP problem and a P solution. And if true then great ... for that problem. But would it lead to solving all other NP problems? Only you can tell us by explaining what you have.
retina is online now   Reply With Quote