Exact, Polynomial, Determination Solution Method of the Subset Sum Problem

Abstract

In this paper we give original geometrical interpretation to the domain of definition of integer and combinatorial problems. The solution of the problems concerning NP class has been carried out on the hyperarches. The existence criterion of the solution on the hyperarches has been defined. The method for establishing the sequence of approximation to the solution on the hyperarches was constructed. Calculation experiments were conducted, and the obtained polynomial algorithm, practically and theoretically solved exactly the (SSP) problem.