Timeline for Set Cover for Permutation Matrices
Current License: CC BY-SA 2.5
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 21, 2010 at 19:11 | vote | accept | Brayden Ware | ||
Nov 15, 2010 at 5:12 | history | edited | Tsuyoshi Ito | CC BY-SA 2.5 |
corrected the approximation ratio of the greedy algorithm, made other small changes
|
Nov 14, 2010 at 22:55 | comment | added | Robin Kothari | @Aaron: I don't know if you said that intentionally, but Ito's lemma is taken (en.wikipedia.org/wiki/Ito_lemma). | |
Nov 14, 2010 at 22:43 | history | edited | Tsuyoshi Ito | CC BY-SA 2.5 |
corrected an inconsistency in the use of symbols
|
Nov 14, 2010 at 22:23 | comment | added | Tsuyoshi Ito | @Aaron: Thanks for your kind comment. Note that the most difficult thing in the question, namely the restriction to the case of a subgroup, is totally ignored in this answer. It’s time to think! | |
Nov 14, 2010 at 22:00 | comment | added | Aaron Sterling | Tsuyoshi, your answers lately have been quite impressive. Someday, one of your proofs on this site will be cited as the Ito Lemma. :-) | |
Nov 14, 2010 at 21:43 | history | answered | Tsuyoshi Ito | CC BY-SA 2.5 |