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.
We use cookies on our website to ensure you get the best experience. Read more about our cookies here.
RSS feed for
Preprints: The Multidisciplinary Preprint Platform
Paste the URL in your RSS reader:
https://www.preprints.org/rss
If you want to subscribe our website in subject-wide, you could find the URL by choosing in the following: