Nieves Rivas, Rodolfo A.
Mathematics and Applied Mathematics
November 4, 2013
NP-complete problems; algorithm; criteria; property.
In this article we present two criteria and a property of the algorithms, then we performed its application to a problem of a NP-complete class belonging to computational complexity theory known as the problem of subset sum, and we concluded with the effectiveness of these criteria to meet the conditions necessary and sufficient to address this problem of decision and we propose its use in the development and design of an algorithm since the application of these criteria can solve this problem and ensure algorithm optimization and determination in polynomial time.