Verifying equivalence of functions with unknown input correspondence

It is pointed out by the authors that most of the methods that tackle the problem of verifying equivalence of two Boolean functions assume that the correspondence of input variables is known. A method that does not require this assumption is proposed. The key to the method is to associate a new signature with each input variable, thereby effectively establishing partial (sometimes total) correspondence between the sets of input variables. The descriptive power of the new signature appears to be very effective.<
>