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 I would prefer a streaming generator so I never have to store it.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.