AC (complexity)

In circuit complexity, AC is a complexity class hierarchy. Each class, ACi, consists of the languages recognized by Boolean circuits with depth O(login) 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.[1]

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

The total hierarchy of AC classes is defined as

> AC=⋃i≥0ACi

## Contents

* 1 Relation to NC
* 2 Variations
* 3 Notes
* 4 References

## 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[2][3]

NCi⊆ACi⊆NCi+1.

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

It is known that inclusion is strict for i = 0.[3]

## 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].[4]

## Notes

1. ↑ (Regan 1999)
2. ↑ (Clote Kranakis)
3. ↑ 3.0 3.1 (Arora Barak)
4. ↑ 4.0 4.1 (Clote Kranakis)

## References

* Arora, Sanjeev; Barak, Boaz (2009), Computational complexity. A modern approach, Cambridge University Press, ISBN 978-0-521-42426-4
* Clote, Peter; Kranakis, Evangelos (2002), Boolean functions and computation models, Texts in Theoretical Computer Science. An EATCS Series, Berlin: Springer-Verlag, ISBN 3-540-59436-1
* Regan, Kenneth W. (1999), "Complexity classes", Algorithms and Theory of Computation Handbook, CRC Press .
* Vollmer, Heribert (1998), Introduction to circuit complexity. A uniform approach, Texts in Theoretical Computer Science, Berlin: Springer-Verlag, ISBN 3-540-64310-9

* v
* t
* e

Important complexity classes (more)

Considered feasible|

* DLOGTIME
* AC0
* ACC0
* TC0
* L
* SL
* RL
* NL
* NC
* SC
* CC
* P
* P-complete
* ZPP
* RP
* BPP
* BQP
* APX

Suspected infeasible|

* UP
* NP
* NP-complete
* NP-hard
* co-NP
* co-NP-complete
* AM
* QMA
* PH
* ⊕P
* PP
* #P
* #P-complete
* IP
* PSPACE
* PSPACE-complete

Considered infeasible|

* EXPTIME
* NEXPTIME
* EXPSPACE
* 2-EXPTIME
* ELEMENTARY
* PR
* R
* RE
* ALL

Class hierarchies|

* Polynomial hierarchy
* Exponential hierarchy
* Grzegorczyk hierarchy
* Arithmetical hierarchy
* Boolean hierarchy

Families of classes|

* DTIME
* NTIME
* DSPACE
* NSPACE
* Probabilistically checkable proof
* Interactive proof system

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/AC (complexity). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=AC_(complexity)&oldid=285719"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template