Timeline for Covering the zeros of 0/1 matrix with submatrices
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2016 at 10:17 | vote | accept | user85022 | ||
| Jan 8, 2016 at 1:46 | comment | added | Douglas Zare | @user85022: I added a lower bound. | |
| Jan 8, 2016 at 1:45 | history | edited | Douglas Zare | CC BY-SA 3.0 |
Added lower bound.
|
| Jan 8, 2016 at 0:53 | comment | added | user85022 | I ask that question because of the solution I just found for $M_{15}$ (see EDIT II in the question). | |
| Jan 8, 2016 at 0:33 | comment | added | user85022 | Very nice! It helps me a lot, thanks! But I have a question which may seems stupid, but is it still possible that the optimal value is much less than $O(log(n))$? Even a constant from a certain $n$? | |
| Jan 7, 2016 at 23:57 | comment | added | kodlu | great answer, I started writing this out after doing a small example but you beat me to it. | |
| Jan 7, 2016 at 23:49 | history | answered | Douglas Zare | CC BY-SA 3.0 |