On Wed, Apr 26, 2006 at 11:21:19PM -0400, Rob wrote:
> both a and bmare in the[1] set, even though hash(a) == hash(b).  This would
> use space O(k+k*log m ) and a running time that is a pain in the ass

Stupid terminal fuckups... that is supposed to read "a and b are in the
set" and below that "O(m+k*log m)[1]"; my term was screwed up so my edit
ended up off by one line :-(


> [1] Using a '+' in big O notation means "which ever is bigger".. it's
> probably obvious but I forget at what level of algorithms they start
> describing that.

-- 

- Rob
.

Reply via email to