Top "Subset-sum" questions

In computer science, the subset sum problem is one of the important problems in complexity theory and cryptography.

Count number of subsets with sum equal to k

Given an array we need to find out the count of number of subsets having sum exactly equal to a …

algorithm count subset-sum
maximum sum of a subset of size K with sum less than M

Given: array of integers value K,M Question: Find the maximum sum which we can obtain from all K element …

algorithm data-structures dynamic-programming subset-sum clrs
Subset sum Problem

recently I became interested in the subset-sum problem which is finding a zero-sum subset in a superset. I found some …

python algorithm subset-sum
given a set of n integers, return all subsets of k elements that sum to 0

given a unsorted set of n integers, return all subsets of size k (i.e. each set has k unique …

java time-complexity subset-sum
sql server : select rows who's sum matches a value

here is table T :- id num ------- 1 50 2 20 3 90 4 40 5 10 6 60 7 30 8 100 9 70 10 80 and the following is a fictional sql select * from T where sum(…

sql sql-server sql-server-2012 subset-sum
Subset sum recursively in Python

I will be happy to get some help. I have the following problem: I'm given a list of numbers seq …

python recursion dynamic-programming memoization subset-sum
Is this variant of the subset sum problem easier to solve?

I have a problem related to the subset sum problem and am wondering if the differences make it easier, i.…

algorithm dynamic-programming np-complete subset-sum
Haskell generate subsets

I have a function 'subsets' which generate all the subsets of a given set: subsets :: [Int] -> [[Int]] subsets [] = [[]] …

haskell subset-sum