AC0

AC⁰ (alternating circuit) is a complexity class used in circuit complexity. It is the smallest class in the AC hierarchy, and consists of all families of circuits of depth O(1) and polynomial size, with unlimited- fanin AND gates and OR gates (we allow NOT gates only at the inputs). It thus contains NC⁰, which has only bounded-fanin AND and OR gates. Such circuits are called "alternating circuits", since it is only necessary for the layers to alternate between all-AND and all-OR, since one AND after another AND is equivalent to a single AND, and the same for OR.

Example problems

Integer addition and subtraction are computable in AC⁰, but multiplication is not (specifically, when the inputs are two integers under the usual binary or base-10 representations of integers).

Since it is a circuit class, like P/poly, AC⁰ also contains every unary language.

Descriptive complexity

From a descriptive complexity viewpoint, DLOGTIME-uniform AC⁰ is equal to the descriptive class FO+BIT of all languages describable in first-order logic with the addition of the BIT predicate, or alternatively by FO(+, ×), or by Turing machine in the logarithmic hierarchy.

Separations

In 1984 Furst, Saxe, and Sipser showed that calculating the PARITY of the input bits (unlike the aforementioned addition/subtraction problems above which had two inputs) cannot be decided by any AC⁰ circuits, even with non-uniformity. Similarly, computing the majority is also not in $\mathsf^0$.
It follows that AC⁰ is strictly smaller than TC⁰. Note that "PARITY" is also called " XOR" in the literature.

However, PARITY is only barely out of AC⁰, in the sense that for any $k > 0$, there exists a family of alternating circuits using depth $\lceil k \ln n / \ln\ln n \rceil$ and size $O\left(2^ \frac \right)$. In particular, setting $k$ to be a large constant, then there exists a family of alternating circuits using depth $O(\ln n / \ln\ln n)\ll O(\ln n)$, and size only slightly superlinear.

More precise bounds follow from switching lemma. Using them, it has been shown that there is an oracle separation between the polynomial hierarchy and PSPACE.

$\mathsf^0$ can be divided further, into a hierarchy of languages requiring up to 1 layer, 2 layers, etc. Let $\mathsf^0_d$ be the class of languages decidable by a threshold circuit family of up to depth $d$:$\mathsf^0_1 \subset \mathsf^0_2 \subset \cdots \subset \mathsf^0 = \bigcup_^\infty \mathsf^0_d$The following problem is $\mathsf^0_d$-complete under a uniformity condition. Given a grid graph of polynomial length and width $k$, decide whether a given pair of vertices are connected.

The addition of two $n$-bit integers is in $\mathsf^0_3$ but not in $\mathsf^0_2$.

References

{{ComplexityClasses

Circuit complexity
Complexity classes