Languages computable by polynomial-size Boolean circuit families of bounded fan-in and depth . 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.
New to topics? Read the docs here!