Timeline for Examples of ubiquitous objects that are hard to find?
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2019 at 23:13 | answer | added | Gerry Myerson | timeline score: 1 | |
| Sep 22, 2019 at 22:05 | answer | added | Zach Teitler | timeline score: 1 | |
| Sep 21, 2019 at 21:34 | answer | added | Sam Hopkins | timeline score: 7 | |
| Dec 31, 2013 at 22:42 | answer | added | Paul Siegel | timeline score: 4 | |
| Dec 31, 2013 at 22:36 | history | made wiki | Post Made Community Wiki by S. Carnahan♦ | ||
| Dec 31, 2013 at 5:20 | answer | added | Timothy Chow | timeline score: 4 | |
| Dec 31, 2013 at 4:06 | answer | added | Igor Rivin | timeline score: 4 | |
| Dec 31, 2013 at 2:31 | answer | added | Stanley Yao Xiao | timeline score: 4 | |
| Dec 30, 2013 at 16:51 | comment | added | Noam D. Elkies | For example mathcamp.org/2013/academics/week4blurbs-mc13.pdf (page 9/10, where it appears as "hay in a haystack"). | |
| Dec 30, 2013 at 16:14 | answer | added | none | timeline score: 5 | |
| Dec 30, 2013 at 12:26 | comment | added | Boris Bukh | Avi Widgerson even referred to the problem as that of "Finding Hay in the Haystack". | |
| Dec 30, 2013 at 12:25 | comment | added | Boris Bukh | That is extremely common situation in combinatorics and computer science. Many probabilistic method proofs give rise to such a situation. For example, we still do not know an explicit construction of Ramsey graphs with exponentially many vertices. | |
| Dec 30, 2013 at 12:14 | history | asked | Dustin G. Mixon | CC BY-SA 3.0 |