Timeline for Binary search generalizations for posets?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 26, 2012 at 17:50 | answer | added | Antoine Amarilli 'a3nm' | timeline score: 5 | |
| Nov 12, 2011 at 11:11 | answer | added | ilyaraz | timeline score: 9 | |
| Nov 11, 2011 at 22:43 | answer | added | Sasho Nikolov | timeline score: 16 | |
| Nov 11, 2011 at 18:08 | history | edited | Suresh Venkat | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Nov 11, 2011 at 17:46 | history | edited | Kaveh |
edited tags
|
|
| Nov 11, 2011 at 15:10 | history | edited | jkff | CC BY-SA 3.0 |
added 78 characters in body
|
| Nov 11, 2011 at 10:55 | answer | added | domotorp | timeline score: 4 | |
| Nov 11, 2011 at 8:20 | history | tweeted | twitter.com/#!/StackCSTheory/status/134908276327460864 | ||
| Nov 11, 2011 at 5:45 | comment | added | jkff | It's the lattice whose elements are mappings X -> N, meet is elementwise min and join is elementwise max. It can be generalized to any lattice instead of N as the codomain. | |
| Nov 11, 2011 at 4:58 | answer | added | Suresh Venkat | timeline score: 8 | |
| Nov 11, 2011 at 4:45 | comment | added | Suresh Venkat | What's the 'multiset' lattice ? | |
| Nov 11, 2011 at 4:39 | history | asked | jkff | CC BY-SA 3.0 |