On May 25, 10:41 pm, [EMAIL PROTECTED] wrote:
> So, basically, V = (v_1, v_2, ... , v_{k-1}, v_k) can be regarded as
> an abstract, k-dimensional vector, right?
Yes.
> If I understand your revised problem statement correctly, what you
> really want to do is build a graph of these vectors, where
On May 25, 7:46 pm, [EMAIL PROTECTED] wrote:
> > I think this problem is related to integer partitioning, but it's not
>
> If, by "integer partitioning," you mean the "subset sum
> problem" (given a finite set S of integers, does S contain a subset
> which sums up to some given integer k?), then y
On May 25, 1:13 pm, "Martin v. Löwis" <[EMAIL PROTECTED]> wrote:
> > We can use any operation or function which
> > takes and returns sets.
>
> I think the problem is significantly underspecified. It would be a more
> interesting problem if there was a restriction to a few selected set
> operations
dear pythonistas,
So imagine that we have a set of sets S. If we pick arbitrarily one
set, s0, what are all the combinations of other sets in S which when
combined by set operations result in s0?
s0 = set([1])
s1 = set([1,2])
s2 = set([2])
S = set([s0,s1,s2])
one answer we're searching for is s0
