Timeline for What is information-theoretic lower bound? [closed]
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2010 at 4:59 | comment | added | Kim Morrison | Closed. Sorry, but we expect a certain level of effort from people asking questions on mathoverflow. Providing sufficient context, especially when asked, is certainly one requirement. To be picky, questions marks are another. Feel free to edit and improve the question up to an appropriate standard, and then flag for moderator attention for reopening. You might look at the mathoverflow.net/howtoask page for ideas about how to write good questions. | |
| Feb 11, 2010 at 4:57 | history | closed | Kim Morrison | not a real question | |
| Feb 11, 2010 at 4:19 | comment | added | Ben Webster♦ | You can edit your posts, and doing so is recommended. | |
| Feb 11, 2010 at 3:22 | comment | added | jeremy | i'm really sorry for not having more context in my question. I was actually referring to the cost of computing a data structure for example OBNR (Order by next request). | |
| Feb 11, 2010 at 3:15 | answer | added | Tal K | timeline score: 2 | |
| Feb 11, 2010 at 3:10 | answer | added | Sridhar Ramesh | timeline score: 1 | |
| Feb 11, 2010 at 3:02 | answer | added | Joel David Hamkins | timeline score: 2 | |
| Feb 11, 2010 at 2:54 | history | asked | jeremy | CC BY-SA 2.5 |