Timeline for Could I possibly exploit distinct odd primes raised to 6 to solve Exact Three Cover, when reducing it in Subset Sum?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12 at 6:57 | comment | added | D.W. | cstheory.stackexchange.com/q/54157/5038, math.stackexchange.com/q/4894190/14578 | |
| Apr 11 at 0:48 | comment | added | The T | I tried creating a collision case by allowing repeated usage of elements when it comes to combinations in $S$, but none of them have equaled to the sum of $S$. Of course, you have to be careful of the subtle details when constructing the code. You have to make sure you don't exceed the size of $S$ when looking for counter-examples. | |
| Apr 10 at 7:56 | comment | added | Gerry Myerson | It's very closely related. It ought to be linked. | |
| Apr 10 at 7:28 | history | edited | YCor | CC BY-SA 4.0 |
fixed typo
|
| Apr 10 at 7:27 | comment | added | The T | @GerryMyerson That question do not mention Exact 3 Cover, thus will not be mentioned in my question. I will also keep that way. This is a different problem. | |
| Apr 10 at 6:57 | comment | added | Gerry Myerson | Question also posted to mathstack, with no notification to either this site or that one, even after user was told to include such links. math.stackexchange.com/questions/4894190/… I hope you will also let cstheory know about your other two posts. What next? puzzling.stack? knitting.stack? | |
| Apr 10 at 5:09 | answer | added | Snared | timeline score: 1 | |
| Apr 10 at 4:25 | history | edited | The T | CC BY-SA 4.0 |
added 71 characters in body
|
| S Apr 10 at 4:16 | review | First questions | |||
| Apr 10 at 5:45 | |||||
| S Apr 10 at 4:16 | history | asked | The T | CC BY-SA 4.0 |