On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions

Bernd Borchert, Desh Ranjan, Frank Stephan. On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. Theory Comput. Syst., 31(6):679-693, 1998. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: