April 8, 2021 porton My algorithm that is NP-complete in the case if P=NP I’ve proved that if P=NP, it’s a constructive problem. np-complete-5Download See also here. Share this:TwitterFacebookLike this:Like Loading... Related