Issue No. 01 - January (1984 vol. 33)
Corina Reischer , Département de Mathématiques, Université du Québec à Trois-Rivières, Québec, Canada.
Dan A. Simovici , Department of Mathematics, University of Massachusetts at Boston, Boston, MA 02125.
We introduce and characterize those Boolean functions (graph functions) which can be regarded as characteristic functions of graphs of other Boolean functions. An algorithm for detecting these functions is also presented. Finally, we discuss the complexity of computing a Boolean function which can be regarded as a graph function.
C. Reischer and D. A. Simovici, "Graph Functions of Boolean Functions," in IEEE Transactions on Computers, vol. 33, no. , pp. 97-99, 1984.