All Questions
1
question
0
votes
1
answer
113
views
An algorithm for the set of subsets with equal sums of a set of numbers (distinct partitions)
Given a set $T\subset\mathbb N^+$ called the set of terms and let $T_n=\{k\in T|k\leq n\}$.
I want to design an efficient algorithm computing the set $\mathcal S_n$ of all subsets $S\subseteq T$ such ...
- 13.9k