Timeline for When is relaxed counting hard?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11, 2010 at 11:18 | comment | added | András Salamon | There were no other answers and the 50 points would have been lost otherwise! The system enforces an arbitrary 7-day limit for bounties. See meta.stackexchange.com/questions/1413/… for discussion of the most recent change in the system. | |
| Oct 11, 2010 at 2:12 | comment | added | Suresh Venkat | nice gesture, Colin ! | |
| Oct 10, 2010 at 23:52 | comment | added | Colin McQuillan | OK. I seem to have stolen the bounty you offered, so I will reoffer 50 points on this question. | |
| Oct 10, 2010 at 19:12 | comment | added | Yaroslav Bulatov | Note that this is asking about relaxed version of counting. For any graph there's a range of c's for which relaxed counting is easy. The question is how to quantify this range | |
| Oct 10, 2010 at 19:06 | history | bounty ended | András Salamon | ||
| Oct 10, 2010 at 15:06 | history | answered | Colin McQuillan | CC BY-SA 2.5 |