The class of decision problems solvable by a family of monotone stratified planar circuits (a uniformity condition may also be imposed).
Such a circuit can contain only AND and OR gates of bounded fanin. It must be embeddable in the plane with no wires crossing. Furthermore, the input bits can only be accessed at the bottom level, where they are listed in order (x1,...,xn).
Defined in [DC89].
[BLM+99] showed that we can assume without loss of generality that the circuit has width n and depth n3.
No class.