Efficiently Computing the Power Set in a Parallel Environment

We develop an approach to find the power set of a given set based on creating disjunctive normal form clauses (DNF) and a round robin load balancing algorithm in a parallel computing environment. Given a problem of size n, the DNF algorithms and the round robin load balance, we will compute the entire power set in O[n / |n/| iterations, concurrently. This reduction in iterations is significantly less than O(2^n) for the sequential algorithms that compute the power set found in Computer Science text books or found in internet searches. The round robin load balance algorithm assigns less than |n/2| processors to the power set problem of size n. This paper gives examples to the power set problem for a relatively large set.