On A Solution of “P vs Np” Millenium Prize Problem Based on the Subset Sum Problem
Б.К. Синчев, Askar Sinchev, Aksulu Mukhanova · Preprints.org · 2023
Given a set of distinct non-negative integers X^n and a target certificate S in parametrized form: ∃X^k⊆X^n,∑_(x_i∈X^k)▒x_i =S (k=|X^k |,n=|X^n |). We present a polynomial solution of the subset sum problem with time complexity T≤O(kn)≤O(n^2) and space complexity S≤O(((n-1)n)/2)≤O(n^2 ), so that P = NP.