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.
| Original language | English |
|---|---|
| Pages (from-to) | 97-99 |
| Number of pages | 3 |
| Journal | IEEE Transactions on Computers |
| Volume | C-33 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1984 |
ASJC Scopus Subject Areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics
Keywords
- Boolean function
- combinational complexity
- graph function
- identifying graph function
Fingerprint
Dive into the research topics of 'Graph Functions of Boolean Functions'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS