On the Delay Required to Realize Boolean Functions

DOI10.1109/T-C.1971.223266MaRDI QIDQ5622111zbMATH OpenOpenAlexFDO

Authors David E. Muller, F. P. Preparata

Publication date 1971

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

Full work available at URL https://doi.org/10.1109/t-c.1971.223266

Mathematics Subject Classification ID

Recommendations

• On the complexity of realizing the powers of a Boolean (n,n)-function
• The generalized complexity of linear Boolean functions
• On the realisation of Boolean functions by informational graphs
• scientific article; zbMATH DE number 4137716
• On the depth of Boolean functions over an arbitrary infinite basis

Cited in

(2)

• Characteristic measures of switching functions
• Delay optimization of linear depth Boolean circuits with prescribed input arrival times

This page was built for publication: On the Delay Required to Realize Boolean Functions

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