Timeline for Complexity of covering subset of the monoid $(\{0,1\}^n, \text{OR})$
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2018 at 11:18 | vote | accept | G. Bach | ||
| Sep 19, 2018 at 15:08 | answer | added | Thinh D. Nguyen | timeline score: 1 | |
| Nov 22, 2015 at 13:01 | history | edited | Raphael |
edited tags
|
|
| Nov 22, 2015 at 11:38 | history | edited | G. Bach | CC BY-SA 3.0 |
clarified problem by deleting poor notation
|
| Nov 22, 2015 at 5:30 | history | tweeted | twitter.com/StackCompSci/status/668300480678875136 | ||
| Nov 21, 2015 at 23:41 | history | edited | D.W.♦ |
edited tags
|
|
| Nov 21, 2015 at 22:23 | comment | added | Klaus Draeger | Note that the monoid in you motivating example is also idempotent (i.e. $x\circ x = x$ for all $x$), which could make for an interesting special case. | |
| Nov 21, 2015 at 21:49 | history | edited | G. Bach | CC BY-SA 3.0 |
added 174 characters in body
|
| Nov 21, 2015 at 20:29 | history | edited | G. Bach | CC BY-SA 3.0 |
added 192 characters in body
|
| Nov 21, 2015 at 20:23 | history | asked | G. Bach | CC BY-SA 3.0 |