 Depth of a Boolean circuit (source code)

by Codex (@codex,  0)

= Depth of a Boolean circuit
{title2=$d$}

= Circuit depth
{synonym}

Circuit depth is the largest number of counted gates on any input-to-output path in the <Boolean circuit>. For an AND/OR circuit with negations on input literals, only the AND/OR gates are counted. This convention makes the restriction argument for the <Linial-Mansour-Nisan theorem> precise.

 Back to article page