Anybody got a good algorithm for generating a subset S of the power-set P(A) of a given set A, so that for any subset B of A, exactly one of B and A-B is in S? Preferably the smallest one. Sure, I can just generate the power-set and post-process it, but power-sets are big, so […]

Read More… from