AC (complexity)

A circuit-complexity hierarchy of languages decidable by polynomial-size, polylogarithmic-depth Boolean circuits with unbounded-fan-in AND and OR gates.

Version

v2 · 2026-09-19 · History

Domain-specific #

3182

Domain group

Applied Sciences & Engineering

Origin domain

Computer Science & Software Engineering

Subdomain

Computational Complexity → Computer Science & Software Engineering

Core Idea

AC^i contains languages recognized by polynomial-size circuit families of depth O(log^i n) using NOT and unbounded-fan-in AND and OR gates, under a stated uniformity convention. Unbounded fan-in compresses large conjunctions and disjunctions into single layers, while the depth exponent stratifies parallel circuit resources. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of computational complexity. It is Changing the gate basis to majority or modular gates yields neighboring TC or ACC classes; omitting uniformity can change the class being asserted..

How would you explain it like I'm…

Counting the Helper Rows

Imagine teams of checkers standing in rows, where each checker can look at many things at once and say 'all yes' or 'any yes'. Puzzles are sorted into groups by how many rows the team needs as the puzzle gets bigger: a fixed number of rows, or rows that grow very, very slowly. Those groups are called the AC classes.

Circuit Depth Ladder

The AC classes sort problems by how shallow a circuit can solve them. The circuits use AND, OR and NOT gates, and AND and OR gates may take in as many wires as they like. The size of the circuit can't grow wildly, but the number of layers is allowed to grow slowly with the size of the input. Each level of AC allows a bit more depth than the one before it, and the lowest level, AC0, allows only a fixed number of layers. If you change which kinds of gates are allowed, you get a different family of classes.

Alternating-Circuit Hierarchy

AC is a family of complexity classes, written AC^i for i = 0, 1, 2 and so on. AC^i contains problems solved by circuit families of polynomial size and depth O(log^i n), meaning the number of layers grows like the i-th power of the logarithm of the input size n. The circuits use NOT gates plus AND and OR gates with unbounded fan-in, so a single gate can combine any number of wires. The exponent i therefore measures how much parallel depth is allowed. The classes also require a stated uniformity rule about how the circuits for different input sizes are constructed. If you allow majority or counting-modulo gates instead, you get neighboring families called TC or ACC, which are different classes.

 

AC^i is the class of languages recognized by circuit families of polynomial size and depth O(log^i n), built from NOT gates and unbounded-fan-in AND and OR gates, under a declared uniformity convention. The hierarchy AC^0, AC^1, ... stratifies parallel circuit resources by the depth exponent: unbounded fan-in collapses a large conjunction or disjunction into a single layer, so depth measures the rounds of dependent computation rather than the width of any one aggregation. Membership requires all four parameters to hold together: polynomial size, the declared polylogarithmic depth bound, the allowed gate basis, and the uniformity condition. Altering any of them changes the class - majority gates give the TC classes, modular counting gates give ACC, and dropping or changing the uniformity condition can change which class is being asserted. The concept is thus a specific, parameterized circuit class, not computational complexity in general.

Scope of Application

AC (complexity) belongs to computational complexity and is useful where the analyst can specify families of Boolean circuits indexed by input length, with size, depth, fan-in, uniformity, and accepted languages, then evaluate the family obeys polynomial size, the declared polylogarithmic depth bound, allowed gate basis, and uniformity condition. The scope is broad within that domain but bounded by the need for the family obeys polynomial size, the declared polylogarithmic depth bound, allowed gate basis, and uniformity condition. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the family obeys polynomial size, the declared polylogarithmic depth bound, allowed gate basis, and uniformity condition the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name AC (complexity) can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to AC (complexity). AC (complexity) compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: families of Boolean circuits indexed by input length, with size, depth, fan-in, uniformity, and accepted languages. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express the family obeys polynomial size, the declared polylogarithmic depth bound, allowed gate basis, and uniformity condition independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of computational complexity because they reuse families of Boolean circuits indexed by input length, with size, depth, fan-in, uniformity, and accepted languages, Unbounded fan-in compresses large conjunctions and disjunctions into single layers, while the depth exponent stratifies parallel circuit resources., and type the carrier, state every parameter and convention in the definition, test that the family obeys polynomial size, the declared polylogarithmic depth bound, allowed gate basis, and uniformity condition, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction AC (complexity) Domain-specific

Parents (1) — outgoing typed relations

• AC (complexity) is a kind of Complexity Prime

  What makes it its own entry: Changing the gate basis to majority or modular gates yields neighboring TC or ACC classes; omitting uniformity can change the class being asserted.

Hierarchy path (1) — routes to 1 parentless root

• AC (complexity) → is a kind of Complexity

Neighborhood in Abstraction Space

AC (complexity) sits in a crowded region of the domain-specific corpus (20^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Computational Complexity Classes & Hierarchies (30 abstractions)

Nearest neighbors

• AC0 — 0.95
• Switching lemma — 0.90
• Arithmetic circuit complexity — 0.90
• Boolean hierarchy — 0.89
• PolyL — 0.89

Computed from structural-signature embeddings · 2026-10-25