subset_sum_counting (434B)
1 # Subset sum counting, aka sharpSubsetSum 2 3 [counting_problem] of computing the number of [subset_sum] solutions; it is [sharpP_hard] 4 5 Variant: counting the subsets whose sum is at most a value T (not "exactly" T) 6 - https://cstheory.stackexchange.com/questions/53767/proving-p-hardness-for-the-number-of-subsets-of-a-set-of-positive-integers-with 7 - also [sharpP_hard] 8 9 Up: [subset_sum], [counting_problem] 10 11 See also: [all_subset_sums]