Comment Comment by YeGoblynQueenne >> I have not checked most of the details, but I think that the claimed o(n log n) bound is plausible.Oh? Well I have not checked most of the details either, but I think that the claimed o(n log n) bound is not plausible at all.Can someone please check most of the details of the paper and resolve our disagreement with Mr Harvey? parent YeGoblynQueenne 9 days ago
Oh? Well I have not checked most of the details either, but I think that the claimed o(n log n) bound is not plausible at all.
Can someone please check most of the details of the paper and resolve our disagreement with Mr Harvey?