Uncategorized My algorithm that is NP-complete in the case if P=NP By Victor PortonOn April 8, 2021 I’ve proved that if P=NP, it’s a constructive problem. np-complete-5Download See also here.