Re: efficient compare

From: Jan Hidders <>
Date: 25 Apr 2006 07:47:07 -0700
Message-ID: <>

Andersen wrote:


> Rephrasing it in math terminology:
> If I have two sets A, and B, containing tuples, and I want to find
> complement(A intersect B), how do I do that efficiently?

Just as a small side note: since the worst-case communication complexity of comparing two strings is O(n) where n is the length of the strings you won't be able to do better than that in the worst case.

  • Jan Hidders
Received on Tue Apr 25 2006 - 16:47:07 CEST

Original text of this message