As for algorithms ... you still haven't fully defined the requirements, so you cannot have an algorithm. "Mutually exclusive elements" has a mathematical definition which has nothing to do with minimum numbers ... it has to do with which elements exist in A that don't exist in B, C, or D.
It sounds like you're trying to find the vector that encompasses the set - the smallest number of elements that uniquely identifies the set vs any other set. That, my friend, is NP-hard in the general case and O(N!) in the specific case. In other words ... find a different solution.
Being right, does not endow the right to be rude; politeness costs nothing.
Being unknowing, is not the same as being stupid.
Expressing a contrary opinion, whether to the individual or the group, is more often a sign of deeper thought than of cantankerous belligerence.
Do not mistake your goals as the only goals; your opinion as the only opinion; your confidence as correctness. Saying you know better is not the same as explaining you know better.
In reply to Re^5: Mutually Exclusive Elements
by dragonchild
in thread Mutually Exclusive Elements
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |