|Nice Question||Question score of 10 or more. This badge can be awarded multiple times.|
JɛﬀE earned this badge 18 times
feb 14 at 19:10Exact planar electrical flow
aug 10 at 6:02Exact number of comparisons to compute the median
may 25 '12 at 2:44Detecting two kinds of almost-simple polygons
mar 30 '12 at 15:26Applications of an access lemma for dynamic forests?
dec 30 '11 at 4:46Permutation game redux
sep 12 '11 at 21:03Complexity of computing the discrete Fourier transform?
may 2 '11 at 3:32Super Mario Galaxy problem
jan 2 '11 at 4:33Sum-of-square-roots-hard problems?
dec 22 '10 at 3:10What is the actual time complexity of Gaussian elimination?
dec 10 '10 at 19:35Time complexity of Bellman-Held-Karp algorithm for TSP, take 2
oct 26 '10 at 5:20Positive topological ordering, take 2
oct 24 '10 at 11:48Other applications of Karger-Stein branching amplification?
oct 6 '10 at 13:29Is it NP-hard to play international draughts correctly?
sep 4 '10 at 2:24Is it hard to find optimal addition chains?
aug 31 '10 at 15:20Is optimally solving the n×n×n Rubik's Cube NP-hard?
aug 30 '10 at 19:14Is there a stable heap?
aug 17 '10 at 7:54How hard is unshuffling a string?