NC1
= NC1
{c}
{title2=$\mathrm{NC}^1$}
Languages computable by polynomial-size <Boolean circuit> families of bounded fan-in and depth $O(\log n)$. One can specify the nonuniform or logspace-uniform convention explicitly. Balanced constant-size operations give examples such as the <MOD3 binary divisibility problem> without nonuniform advice.