The set-theoretical modification of Boolean functions minimax covering method

The set-theoretical modification of minimax covering method of Boolean functions has been considered. The modificated method is based on the proposed procedure of prime conjuncterms weighing. As distinct from traditional ones, the proposed algorithm allows correction of the covering progress by choosing a shorter way.