Timeline for All possible linear combinations of positive half-integers with coefficients +/- 1
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2013 at 10:02 | vote | accept | Daniel | ||
| S Mar 6, 2013 at 10:02 | vote | accept | Daniel | ||
| Mar 6, 2013 at 10:02 | |||||
| Mar 6, 2013 at 10:02 | vote | accept | Daniel | ||
| S Mar 6, 2013 at 10:02 | |||||
| Mar 6, 2013 at 1:54 | answer | added | awynjones | timeline score: 1 | |
| Mar 6, 2013 at 1:43 | comment | added | Gerhard Paseman | Indeed, and as is the case for subset sum, there is a pseudo-polynomial time solution using dynamic programming that might help answer the posted question. Gerhard "Ask Me About System Design" Paseman, 2013.03.05 | |
| Mar 6, 2013 at 1:27 | answer | added | Günter Rote | timeline score: 3 | |
| Mar 6, 2013 at 0:39 | comment | added | Yoav Kallus | For arbitrary $p_i$, calculating the value of $\mu(P)$ for some $P$ is equivalent to the subset sum problem, an NP-Complete problem. | |
| Mar 5, 2013 at 23:04 | answer | added | Gerhard Paseman | timeline score: 1 | |
| Mar 5, 2013 at 22:07 | answer | added | Per Alexandersson | timeline score: 2 | |
| Mar 5, 2013 at 21:52 | history | asked | Daniel | CC BY-SA 3.0 |