AC (complexity): Difference between revisions
Appearance
Content deleted Content added
Line 17: | Line 17: | ||
==Variations== |
==Variations== |
||
The power of the AC classes can be affected by adding additional gates. If we add gates |
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<sup>i</sup>[m]]]. |
||
==References== |
==References== |
Revision as of 19:58, 11 October 2007
In circuit complexity, AC is a complexity class hierarchy. Each class, ACi, consists of the languages recognized by Boolean circuits with depth and a polynomial number of unlimited-fanin AND and OR gates.
The smallest AC class is AC0, 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[citation needed] , but with gates having only constant fanin. For each i, we have
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 ACCi[m].
References
- Vollmer, Heribert (1999). Introduction to Circuit Complexity. Berlin: Springer. ISBN 3-540-64310-9.