Timeline for Determining if some permutation of a vector satisfies a system of linear equations
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 4, 2018 at 14:18 | vote | accept | Jack M | ||
| Aug 4, 2018 at 12:11 | history | edited | Peter Heinig | CC BY-SA 4.0 |
Correct an obvious typo.
|
| Aug 4, 2018 at 12:08 | comment | added | Brendan McKay | @JackM See my addition "First..". | |
| Aug 4, 2018 at 12:07 | history | edited | Brendan McKay | CC BY-SA 4.0 |
added 95 characters in body
|
| Aug 3, 2018 at 19:38 | comment | added | Jack M | So my problem is a generalization of PARTITION. Doesn't this only show that the problem is NP-hard? I don't see how it shows NP-completeness. | |
| Aug 3, 2018 at 11:57 | comment | added | Emil Jeřábek | No need for belief, just take $A=(1,1,\dots,1,-1,-1,\dots,-1)$. | |
| Aug 3, 2018 at 11:50 | history | answered | Brendan McKay | CC BY-SA 4.0 |