News for hackers. Stuff that matters.
Re:Approximate search for LaTeX formulae by drbaskin on Wednesday December 08, 2010 @08:16AM (#1982792)
I'm sure that you have an implicit statement about the constants when you imply that O(log_{k}(|T|)) is an improvement over O(log_{2}(|T|)), but log_{2}(|T|) = {log_{k}(|T|)} / {log_{k} (2)}. Correct me if I'm wrong, but in terms of big-O notation, I think this makes O(log_{2}(|T|)) the same as O(log_{k}(|T|)).

There are no comments on this comment yet.