in reply to Re^2: decomposing binary matrices in thread decomposing binary matrices
Sticking with the bitstring concept, I think rather that you are looking for a subset of n bitstrings such that the bitwiseOR of the bitstrings has only n distinct bits set.
Note that some or all of those bitstrings may have fewer than n bits set; you may even have two bitstrings that have no bit set in common in a qualifying subset (though you'd need a minimum of 4 elements in the subset to avoid it being further decomposable).
Hugo
Re^4: decomposing binary matrices by Limbic~Region (Chancellor) on Feb 16, 2007 at 14:28 UTC 
hv,
I understand now that to be considered for extraction, a variable need not have the exact same 1s and 0s in common. I need to go but I still think this sounds like a good logic programming candidate.
 [reply] 
