Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays
From MaRDI portal
Publication:3914890
DOI10.1109/TC.1981.1675861zbMath0463.94011MaRDI QIDQ3914890
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items (2)
Hierarchical fuzzy modeling and jointly expandable functions ⋮ Logic design of decoded-programmable logic arrays
This page was built for publication: Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays