Title :
Graph Functions of Boolean Functions
Author :
Reischer, Corina ; Simovici, Dan A.
Author_Institution :
Département de Mathématiques, Université du Québec Ã\xa0 Trois-Riviÿres, Québec, Canada.
Abstract :
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.
Keywords :
Automation; Boolean algebra; Boolean functions; Character generation; High level languages; Mathematics; Minimization methods; Notice of Violation; Zinc; Boolean function; combinational complexity; graph function; identifying graph function;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1984.5009317
