Timeline for Subexponentially solvable hard graph problems
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2011 at 8:10 | history | edited | Hsien-Chih Chang 張顯之 |
edited tags
|
|
| Dec 19, 2010 at 21:37 | vote | accept | Mohammad Al-Turkistany | ||
| Dec 8, 2010 at 16:24 | answer | added | Luca Trevisan | timeline score: 20 | |
| Dec 8, 2010 at 4:51 | answer | added | Hsien-Chih Chang 張顯之 | timeline score: 15 | |
| Dec 8, 2010 at 0:32 | comment | added | Sadeq Dousti | Just for completeness: log-CLIQUE = $\{(G, k) | G \text{ has }n\text{ vertices, }k = \log n\text{ and }G\text{ has a clique of size }k\}$ | |
| Dec 7, 2010 at 20:35 | answer | added | Dana Moshkovitz | timeline score: 8 | |
| Dec 7, 2010 at 13:08 | answer | added | XXYYXX | timeline score: 12 | |
| Dec 7, 2010 at 12:32 | answer | added | Bart Jansen | timeline score: 22 | |
| Dec 7, 2010 at 11:48 | history | edited | Mohammad Al-Turkistany | CC BY-SA 2.5 |
added details
|
| Dec 7, 2010 at 11:31 | history | asked | Mohammad Al-Turkistany | CC BY-SA 2.5 |