Data Structures and Algorithms

Solving Subset Sum in Polynomial Time and Prooving P = NP

Authors: Samir Bouftass
Comments: 8 Pages.

In this paper, we show that subset sum problem is solvable in polynomial time.
Category: Data Structures and Algorithms