Review of works on the use of majority Boolean algebra for the syn- thesis of combinational logic schemes
The article contains an overview of the results on the application of the
majority logic of combinational logic circuits. In the first part, the
theoretical foundations of the questions of majority algebra and some
algorithms for solving practical problems of synthesis of circuits are
considered. This second part describes algorithms based on majority-inverter
graphs MIG and majority primitives combination MPC.