The Fanout Structure of Switching Functions
From MaRDI portal
Cited in
(4)- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Partially unate Boolean functions: properties of their sum-of-products representations
- Read-Once Functions Revisited and the Readability Number of a Boolean Function
- Factoring Boolean functions using graph partitioning
This page was built for publication: The Fanout Structure of Switching Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4160843)