Abstract: The initial steps of logic synthesis of digital designs involve finding minimized representations of Boolean logic functions. Existing optimization methods rely on iterative minimization ...
Abstract: The Boolean matching problem via NP-equivalence requires determining whether two Boolean functions are equivalent or not up to a permutation and negation of the input binary variables. Its ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results