Bloom filter (BF) has been widely used to support membership query, ie, to judge whether a
given element x is a member of a given set S or not. Recent years have seen a flourish …

Boolean Matching problem determines whether two Boolean functions are functionally
equivalent under the permutation and negation of inputs and outputs. Prior contest [1] has …

An efficient pairwise Boolean matching algorithm for solving the problem of matching single-
output specified Boolean functions under input negation and/or input permutation and/or …

Boolean Matching is significant to industry applications, such as library binding, synthesis,
engineer change order, and hardware Trojan detection. Instead of basic Boolean matching …

This paper proposes an NPN Boolean matching algorithm under the transformation of input
negation and/or input permutation and/or output negation. The algorithm utilizes the cofactor …