Lesson plan
AC (complexity)
In circuit complexity, AC is a complexity class hierarchy. Each class, AC i , 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. The smallest AC class is AC 0 , consisting of constant-depth unlimited fan-in circuits. The total hierarchy of AC classes is defined as \mbox{AC} = \bigcup_{i \geq 0} \mbox{AC}^i
Article summary
In circuit complexity, AC is a complexity class hierarchy. Each class, AC i , 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. The smallest AC class is AC 0 , consisting of constant-depth unlimited fan-in circuits. The total hierarchy of AC classes is defined as \mbox{AC} = \bigcup_{i \geq 0} \mbox{AC}^i
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.