Timeline for Overlapping sets
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 21, 2013 at 9:25 | comment | added | domotorp | While a bit related, this problem is not exactly what you are looking for. In case you want to know more about geometric cover-decomposition, let me recommend the first part of my PhD: cs.elte.hu/~dom/cikkek/thesis.pdf | |
Sep 20, 2013 at 22:59 | history | edited | Chassaing | CC BY-SA 3.0 |
added 67 characters in body
|
Sep 20, 2013 at 9:52 | comment | added | Per Alexandersson | Ah, interesting! This do require an infinite number of elements in F, \tilde F and \hat F, it seems like, but this is certainly a bit related. | |
Sep 20, 2013 at 8:35 | history | answered | Chassaing | CC BY-SA 3.0 |