A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Boolean matching determines whether two given (in)completelyspecified Boolean functions can be identical or complementary to each other under permutation and/or negation of their input variables. Due to its broad applications in logic synthesis and verification, it attracted much attention. Most prior efforts however were incomplete and/or restricted to certain special matching conditions. In contrast, this paper focuses on the computation kernel of Boolean matching and proposes a completedoi:10.1145/1837274.1837398 dblp:conf/dac/LaiJW10 fatcat:fre2vbtntvcs3a76kf2px3czry