International Journal of Emerging Trends & Technology in Computer Science
A Motivation for Recent Innovation & Research
ISSN 22786856
www.ijettcs.org
Call for Paper, Published Articles, Indexing Infromation
Title: 
Subset Sum ProblemNew Representation Approach for finding the solution

Author Name: 
Dr. Anil Kumar Singh, Mr. Anand Kumar Dixit 
Abstract: 
Abstract
The Subset Sum problem is an non deterministic problem where
we need to find a resultant number from a set of numbers to
perform the addition of subset of a set. Nonpolynomial
problems comprise of the set of decision problems where answer
to any instance of the problem is true then it can be easily
proved why the solution is true. NonDeterministic Polynomial
problems are the collection of problems where if the solution is
true, then it provides the complexity of the problem in
polynomial time [1]. In this paper we will demonstrate the new
representation method for subset sum problem which is very
easy and help to the students and research scholar to find the
solution.
Keywords: Subset Sum Problem, NonDeterministic
Polynomial problem (NPC), Password generation
techniques, Backtracking. 
Cite this article: 
Dr. Anil Kumar Singh, Mr. Anand Kumar Dixit , "
Subset Sum ProblemNew Representation Approach for finding the solution " , International Journal of Emerging Trends & Technology in Computer Science (IJETTCS),
Volume 6, Issue 6, November  December 2017 , pp.
133135 , ISSN 22786856.
