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

DOI10.1109/TC.1986.1676729zbMATH Open0581.94025OpenAlexW2010285477MaRDI QIDQ3705360

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

Related Items (3)

Partitioning 1-variable Boolean functions for various classification ofn-variable Boolean functions ⋮ Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams ⋮ Title not available (Why is that?)

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)