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]

Authors

Bernd Borchert

This author has not been identified. Look up 'Bernd Borchert' in Google

Desh Ranjan

This author has not been identified. Look up 'Desh Ranjan' in Google

Frank Stephan

This author has not been identified. Look up 'Frank Stephan' in Google