AC (complexity)

In circuit complexity, AC is a complexity class hierarchy. Each class, ACⁱ, consists of the languages recognized by Boolean circuits with depth $O({\log }^{i}n)$ and a polynomial number of unlimited fan-in AND and OR gates.

The name "AC" was chosen by analogy to NC, with the "A" in the name standing for "alternating" and referring both to the alternation between the AND and OR gates in the circuits and to alternating Turing machines.Template:Sfnp

The smallest AC class is AC⁰, consisting of constant-depth unlimited fan-in circuits.

The total hierarchy of AC classes is defined as

$\text{AC}=\bigcup _{i\ge 0}{\text{AC}}^i$

Relation to NC

The AC classes are related to NC, ACC, and TC classes. For each i, we have

${\mathsf{N}\mathsf{C}}^i\subseteq {\mathsf{A}\mathsf{C}}^i\subseteq {\mathsf{A}\mathsf{C}\mathsf{C}}^i\subseteq {\mathsf{T}\mathsf{C}}^i\subseteq {\mathsf{N}\mathsf{C}}^{i+1}.$

As an immediate consequence of this, we have that NC = AC = ACC = TC.Template:Sfnp

We have ${\mathsf{N}\mathsf{C}}^0⊊{\mathsf{A}\mathsf{C}}^0⊊{\mathsf{A}\mathsf{C}\mathsf{C}}^0$. Specifically, PARITY is in ${\mathsf{A}\mathsf{C}\mathsf{C}}^0$ but not in ${\mathsf{A}\mathsf{C}}^0$.Template:Sfnp And since NC requires bounded fan-in, any function of type $\{0,1{\}}^n\to \{0,1\}$ whose output depends on more than $O(1)$ inputs is beyond ${\mathsf{N}\mathsf{C}}^0$. In particular, the unbounded fan-in OR is beyond ${\mathsf{N}\mathsf{C}}^0$.

In detail, define $f_n:\{0,1{\}}^n\to \{0,1\}$ by $f_n(x_1,\dots ,x_n)=\sum _i{x}_{i}mod2$. Then it requires $\mathrm{\Omega }(2^{\frac{n^{1/d}}{16}})$ gates to be computed by a ${\mathsf{A}\mathsf{C}}^0$ circuit with depth $\le d$.Template:Sfnp

Variations

The power of the AC classes can be affected by adding additional gates. If we add gates which calculate the modulo operation for some modulus m, we have the classes ACCⁱ[m].Template:Sfnp

References

• .