An Approximate Algorithm for Finding the Complexity of Reversible Implementations Boolean Functions’ Extended Kronecker Forms

In this paper, the research of the problem of reversible implementations of Boolean functions’ polynomial normal representations (exclusive-or sum-of-products expressions) continues. An implementation of the algorithm for finding the complexity of reversible implementations Boolean functions’ extended Kronecker forms is given. These researches are also theoretical interest and can be used to find an unknown estimate of the Shannon function’s value of the complexity of Boolean functions’ representations in the corresponding class of reversible implementations.