This paper proposes innovations in teaching the course of discrete mathematics at universities, innovations refer to the “Boolean functions” section. A fast method for constructing the Zhegalkin ...

A map from Boolean function to efficient circuit can be done by several algorithms such as Karnaugh maps and Quine-McCluskey method To arrive the definition of Boolean algebra we have to build from ...

Beronika Daxner, Antoine Genitrini, Bernhard Gittenberger, Cécile Mailler, THE RELATION BETWEEN TREE SIZE COMPLEXITY AND PROBABILITY FOR BOOLEAN FUNCTIONS GENERATED BY UNIFORM RANDOM TREES, Applicable ...

It covers a number of directions, including completeness theorem and compactness theorem for hyperidentities; the characterizations of the Boolean algebra of n-ary Boolean functions and the bounded ...

ABSTRACT: This survey article illustrates many important current trends and perspectives for the field and their applications, of interest to researchers in modern algebra, mathematical logic and ...