Timeline for Find if it's possible to partition a set into 3 disjoint sets each with same sum
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2021 at 16:42 | comment | added | Inuyasha Yagami | @Avra It is given in your answer that: "$M[x,y,k] = 1$ iiff there are two disjoint subsets $I,J \subset \{1, \cdots, k\}$ such that their summation is equal, that is $\Sigma_{i \in I} a_i = x$ and $\Sigma_{j \in J} a_j = y$." I do not understand what else to explain here. :) | |
| Oct 22, 2021 at 12:15 | comment | added | Avv | So how what will $M[x][y][k]$ stands for each iteration please? What the rows and columns of our table $M$ stand for? | |
| Oct 22, 2021 at 11:18 | history | edited | Inuyasha Yagami | CC BY-SA 4.0 |
deleted 9 characters in body
|
| Oct 22, 2021 at 11:09 | vote | accept | Avv | ||
| Oct 22, 2021 at 10:30 | history | answered | Inuyasha Yagami | CC BY-SA 4.0 |