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. Electronic Colloquium on Computational Complexity (ECCC), 3(33), 1996. [doi]

Abstract

Abstract is missing.