Abstract

In this paper we investigate the possibility of faster calculation of operations on Boolean functions. We use the representation of function as an ordered list of ternary or Boolean vectors and propose a faster algorithm to reduce their number, profit by ordering. We sort the vectors in lists using the number of ones and strokes and create a model of classes and subclasses. This model is used in faster blockbuilding algorithm.
Our algorithm is compared with three other algorithms, and finally it is shown by means of experimental results that our algorithm with ordering of vectors need fewer comparisons and can find more pairs of vectors, which can build a block.