Badge
| Nice Answer | Answer score of 10 or more. This badge can be awarded multiple times. |
Neal Young earned this badge 9 times |
mar 26 at 23:58
Approximate 1d TSP with linear comparisons?
mar 20 at 21:53
Lower bound on number of oracle calls for solving $n$ instances of the halting problem
mar 20 at 21:22
Sorting using a black box
dec 1 at 12:53
Balls and Bins analysis in the $m \gg n$ regime: gaps
nov 24 at 5:50
Splitting a graph into minimum number of subpaths
nov 20 at 23:03
Robustness of splitting a junta
