6
AC
0
•
Fix n
¸
0. A boolean circuit with n inputs, C,
is a rooted DAG with nodes labeled with
labels from:
{
Æ
,
Ç
,
:
, x
1
, …, x
n
}
•
•
size(C) = number of gates
•
depth(C) = length of longest path