Timeline for Complexity of a combinatorial constraint
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2020 at 7:40 | vote | accept | Jiayi Liu | ||
| Apr 20, 2020 at 7:33 | vote | accept | Jiayi Liu | ||
| Apr 20, 2020 at 7:40 | |||||
| Apr 19, 2020 at 12:16 | answer | added | Johannes Schürz | timeline score: 3 | |
| Apr 19, 2020 at 4:54 | comment | added | Jiayi Liu | It is "for some $s<r$". Thanks~ | |
| Apr 19, 2020 at 4:53 | history | edited | Jiayi Liu | CC BY-SA 4.0 |
added 1 character in body
|
| Apr 18, 2020 at 14:26 | comment | added | Dan Turetsky | In 2, did you mean for some $s < r$, rather than all $s < r$? Because as it is now, making $r$ larger makes it harder for such a $Q$ to exist, and so your argument for $r=1$ settles the question. | |
| Apr 18, 2020 at 12:40 | history | asked | Jiayi Liu | CC BY-SA 4.0 |