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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.