An algorithm for reduct of Boolean functions based on primes

The reduct of Boolean functions is widely used in many applications, for example: digital circuits. In this paper, we present an approach, which is based on primes, to representing the Boolean system. We present an algorithm for reduct of Boolean functions based on primes, and the cost of the algorithm is analyzed to indicate that the algorithm is efficient.