Abstract

Solving large systems of Boolean equations is a hard combinatorial problems. It can be greatly facilitated by preliminary reducing the number of roots in separate equations which, in its turn, leads to decreasing the number of variables in a considered system and the number of equations. Three reduction methods are suggested in this paper for that, called spreading of constants, local reduction and technique of syllogisms. They were programmed in C++, and extensive experiments were conducted on PC Pentium 100, witnessing high efficiency of the methods and their applicability in a wide range of system parameters.