Reduction of Depth of Boolean Networks with a Fan-In Constraint

DOI10.1109/TC.1977.1674864MaRDI QIDQ4135413zbMATH OpenFDO

Authors David E. Muller, F. P. Preparata, Amnon Barak

Publication date 1977

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

Full work available at URL https://doi.org/10.1109/TC.1977.1674864

Mathematics Subject Classification ID

Cited in

(3)

• Lower bounds on the depth of monotone arithmetic computations
• The delay of circuits whose inputs have specified arrival times
• On a relation between the depth and complexity of monotone Boolean formulas

This page was built for publication: Reduction of Depth of Boolean Networks with a Fan-In Constraint

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