# Re: efficient compare

From: Jan Hidders <hidders_at_gmail.com>

Date: 25 Apr 2006 07:47:07 -0700

Message-ID: <1145976427.835500.108750_at_i40g2000cwc.googlegroups.com>

> 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?

Date: 25 Apr 2006 07:47:07 -0700

Message-ID: <1145976427.835500.108750_at_i40g2000cwc.googlegroups.com>

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