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-fanin AND and OR gates.

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

The total hierarchy of AC classes is defined as

Relation to NC

The AC classes are related to the NC classes, which are defined similarly, but with gates having only constant fanin. For each "i", we have:$mbox\{NC\}^i\; subseteq\; mbox\{AC\}^i\; subseteq\; mbox\{NC\}^\{i+1\}.$

As an immediate consequence of this, we have that NC = AC.

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 (complexity)|ACCⁱ [m] .

References

*cite book | last = Vollmer | first = Heribert | title = Introduction to Circuit Complexity | year = 1999 | publisher = Springer | location = Berlin | id = ISBN 3-540-64310-9