On computing stratified structure of Boolean functions from n-cubes

DOI10.1016/0045-7906(84)90016-8zbMATH Open0537.94037OpenAlexW2090900852MaRDI QIDQ792965FDOQ792965

Authors: Ranjan Kumar Sen 

Publication date: 1984

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7906(84)90016-8

Recommendations

• Graph-Based Algorithms for Boolean Function Manipulation
• Partial decoding of monotonic Boolean functions
• scientific article; zbMATH DE number 4200277
• Publication:3495384
• scientific article; zbMATH DE number 3937107

zbMATH Keywords

n-cuberegular bipartite graphstratified structure of Boolean functionssynthesis of MOS networks

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

This page was built for publication: On computing stratified structure of Boolean functions from n-cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792965)