d = depth g
d = depth G
H = countGates g
H = countGates G
The depth of an algebraic circuit is the length of the longest path of evaluations from any input gate to any output gate.
|
|
|
|
|
depth is not the sole indicator of circuit complexity. For instance, the total number of gates in a circuit (sometimes referred to as its "size") also plays a role. "countGates" returns the number of constituent Gates according to their type.
|
|
|
|
|
|
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/SLPexpressions/doc.m2:632:0.