This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Graph Functions of Boolean Functions
January 1984 (vol. 33 no. 1)
pp. 97-99
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.
Citation:
Corina Reischer, Dan A. Simovici, "Graph Functions of Boolean Functions," IEEE Transactions on Computers, vol. 33, no. 1, pp. 97-99, Jan. 1984, doi:10.1109/TC.1984.5009317
Usage of this product signifies your acceptance of the Terms of Use.