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
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2021 at 11:09 | vote | accept | Avv | ||
| Oct 22, 2021 at 10:30 | answer | added | Inuyasha Yagami | timeline score: 1 | |
| Oct 22, 2021 at 9:57 | comment | added | Inuyasha Yagami | @Avra Could you please not write the word "please" in the middle of your sentences. It breaks the flow while reading the text. | |
| Oct 21, 2021 at 18:40 | history | edited | Avv | CC BY-SA 4.0 |
edited body
|
| Oct 21, 2021 at 18:40 | comment | added | Avv | @YuvalFilmus. Thanks Prof. I still not sure why we took the sum as the range of indices in out table matrix $M$ above. How would you interpret recursion formula above in your own words please? | |
| Oct 21, 2021 at 18:39 | comment | added | Avv | @PålGD. Thanks for the question. Not sure Prof. | |
| Oct 21, 2021 at 18:14 | comment | added | Yuval Filmus | You can reduce PARTITION to your problem: given a PARTITION instance with sum $2S$, add another number equal to $S$. | |
| Oct 21, 2021 at 18:07 | comment | added | John Kemeny | Do you think it could be NP-hard? | |
| Oct 21, 2021 at 15:38 | history | edited | Avv | CC BY-SA 4.0 |
added 593 characters in body
|
| Oct 21, 2021 at 15:22 | history | asked | Avv | CC BY-SA 4.0 |