 P/poly also has the interesting feature that it can be equivalently defined as the class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function.Two subclasses of P/poly that have interesting properties in their own right are NC and AC.These classes are defined not only in terms of their circuit size but also in terms of their "depth".