subset sum problem
The subset sum problem is a mathematical problem that seeks to determine whether a given set of integers contains a subset that sums up to a target value. The problem is NP-complete, which means that it is difficult to solve and can take a long time to find a solution.
Requires login.
Related Concepts (1)
Similar Concepts
- addition and subtraction
- collective action problem
- completeness theorem
- halting problem
- knapsack problem
- longest common subsequence
- mathematical programming
- maximum subarray problem
- optimization problems
- problem solving
- problem-solving in groups
- recursive problem-solving
- semi-supervised learning
- the problem of induction
- traveling salesman problem