The Depth of All Boolean Functions

DOI10.1137/0206026MaRDI QIDQ4135409zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL http://wrap.warwick.ac.uk/46304/1/WRAP_McColl_cs-rr-007.pdf

Mathematics Subject Classification ID

Cited in

(3)

• On the depth complexity of formulas
• The size and depth of layered Boolean circuits
• Threshold circuits of bounded depth

This page was built for publication: The Depth of All Boolean Functions

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