Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits

DOI10.1109/TC.1986.1676729MaRDI QIDQ3705360zbMATH OpenOpenAlexFDO

Authors A. Maruoka

Publication date 1986

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1986.1676729

zbMATH Keywords

Boolean functioncombinational circuitscomplexity measureminimum number of subcircuits of a Boolean circuit

Mathematics Subject Classification ID

Recommendations

• On the multiplicative complexity of Boolean functions
• scientific article; zbMATH DE number 4187721
• scientific article; zbMATH DE number 4137716
• scientific article; zbMATH DE number 4012495
• On the complexity of restrictions of Boolean functions

Cited in

(4)

• Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
• Partitioning 1-variable Boolean functions for various classification ofn-variable Boolean functions
• scientific article; zbMATH DE number 4068271 (Why is no real title available?)
• On the complexity of Boolean functions computed by lazy oracles

This page was built for publication: Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits

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