Funções de assinatura para correspondência booleana

Abstract

Signature Functions are intended to compute compact representations that characterize some properties of Boolean functions, called signatures. Each Boolean function has a unique signature, but a signature can be related to one or more functions. Canonical forms can be used to verify that two functions are equivalent, but they are very costly, so the use of signature functions can help shorten the search space for equivalence by quickly disqualifying designs that are not equivalent.