Timeline for Solve a linear equation with many variables using only 1 and -1
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 12, 2013 at 17:04 | comment | added | kryo | Thanks guys, I ended up solving this with a semi-brute force method. I was hoping for a mathematical solution, but my method should be quicker than what I had before. | |
| Dec 10, 2013 at 0:00 | comment | added | Yoav Kallus | @GerryMyerson: judging by OP's example, they mean the least positive value that the left-hand side can take. | |
| Dec 9, 2013 at 23:01 | comment | added | Gerry Myerson | What do you mean by "positive" solution, when you allow the variables to take on the value $-1$? | |
| Dec 9, 2013 at 21:53 | review | Close votes | |||
| Dec 10, 2013 at 12:33 | |||||
| Dec 9, 2013 at 21:33 | comment | added | Yoav Kallus | You probably want to read the answers to this closely related question: mathoverflow.net/questions/123670/… | |
| Dec 9, 2013 at 21:22 | comment | added | Yoav Kallus | In particular, this is the partition problem: en.wikipedia.org/wiki/Partition_problem | |
| Dec 9, 2013 at 20:48 | review | First posts | |||
| Dec 9, 2013 at 20:53 | |||||
| Dec 9, 2013 at 20:43 | comment | added | Qiaochu Yuan | This is something like zero-one linear programming which in general is NP-complete. | |
| Dec 9, 2013 at 20:28 | history | asked | kryo | CC BY-SA 3.0 |