Polynomial implementation of partial Boolean functions and systems

When designing logical exor schemes containing the elements of summation according to the module 2, the tasks of the optimal representation of bully functions and systems by the polynomas of Zhegalkin and Rida Maller arise. This combinatorial task is significantly complicated in the case of non -fully defined bully functions. In 1995-1997 At the Institute of Technical Cybernetics of the National Academy of Sciences of Belarus, studies were conducted on the development of almost effective methods, algorithms and programs to solve it. The results are published in a series of scientific articles and are generalized in this book.
Designed for students, graduate students and specialists in the design of logical schemes