Abstract: In this paper, we study the problem of finding the complexity of representations of Boolean functions in classes of polynomials and reversible circuits of a special form. The extending ...

A Boolean Algebra operation can be related with an electronic circuit in which the inputs and outputs corresponds to the statements of Boolean algebra. Though these circuits may be complicated, they ...

We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n-1 ...

This project implements a parallel solution for evaluating boolean circuits using Java's concurrent programming features. The implementation focuses on efficient lazy evaluation and optimal thread ...

Abstract: Functional verification is an important design method for verifying functional equivalence between a simplified quantum Boolean circuit and original one. During the design process, checking ...

The Quine-McCluskey algorithm, also known as the tabulation method, is a method used for minimization of Boolean functions. It is an exact method and provides a systematic approach to simplify Boolean ...