Timeline for Fast algorithm for finding all solutions of simple equation involving only addition of terms from list
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2020 at 6:09 | vote | accept | Mario Krenn | ||
| Jul 30, 2019 at 16:15 | answer | added | Daniel Lichtblau | timeline score: 5 | |
| Jul 22, 2019 at 0:48 | history | became hot network question | |||
| Jul 22, 2019 at 0:00 | history | tweeted | twitter.com/StackMma/status/1153092404569870336 | ||
| Jul 21, 2019 at 16:59 | answer | added | kglr | timeline score: 5 | |
| Jul 21, 2019 at 16:52 | comment | added | Mario Krenn |
@kglr wow I was trying IntegerPartitions before and couldnt get it work, i didnt know about the third argument. It works for rational numbers, that is already really cool, thanks! Could this be extended to complex values? (at least for question 2?) Thaanks!!
|
|
| Jul 21, 2019 at 16:44 | comment | added | kglr |
IntegerPartitions[S, {m}, X] and post-process (Permutations)?
|
|
| Jul 21, 2019 at 16:40 | comment | added | lirtosiast | This isn't exactly the subset sum problem, but dynamic programming seems like the answer. | |
| Jul 21, 2019 at 16:35 | history | asked | Mario Krenn | CC BY-SA 4.0 |