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]
@article{BorchertRS98,
title = {On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions},
author = {Bernd Borchert and Desh Ranjan and Frank Stephan},
year = {1998},
url = {http://link.springer.de/link/service/journals/00224/bibs/31n6p679.html},
researchr = {https://researchr.org/publication/BorchertRS98},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {31},
number = {6},
pages = {679-693},
}