AC0¶

The circuit-complexity class of Boolean functions computed by polynomial-size, constant-depth families with unbounded-fanin AND and OR gates and input-level negations.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3181
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomain: Computational Complexity → Computer Science & Software Engineering

Core Idea¶

AC0 is the first alternating-circuit level, is closed under standard Boolean composition and cannot compute parity under the usual uniform or nonuniform definitions, though uniformity conventions matter. Each input length receives a shallow circuit; unbounded fan-in aggregates many bits per layer while the constant depth restricts sequential logical interaction despite polynomial total size. 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.

How would you explain it like I'm…

Few-Rows Checker Team

Imagine a row of light switches and a team of helpers standing in just a few lines. Each helper can look at as many switches or helpers in front of them as they like, but can only answer 'are they all on?' or 'is any one on?'. The team may grow as switches are added, but not wildly, and it never gets more lines. Helpers stuck in only a few lines like that can't tell whether an odd or even number of switches are on once there are lots of switches.

Shallow Wide Circuits

Computer scientists study problems that can be solved by circuits made of simple logic gates: AND, OR and NOT. AC0 is the group of problems solvable by circuits with only a fixed number of layers, no matter how big the input gets, though the total number of gates can grow at a reasonable rate. Each AND or OR gate is allowed to take in as many wires as it wants. Even with all those wires, the few layers limit what the circuit can do: famously, such circuits cannot figure out whether the number of 1s in the input is even or odd, which is called parity.

Constant-Depth Circuit Class

AC0 is a complexity class defined by families of Boolean circuits: one circuit for each input length, built from AND, OR and NOT gates. Three limits define it: the depth (number of layers) is a constant that doesn't grow with input size; the total number of gates grows only polynomially; and AND and OR gates have unbounded fan-in, meaning a single gate can combine any number of inputs. Unbounded fan-in lets one layer aggregate many bits at once, but constant depth restricts how much step-after-step logic can happen. A central result is that AC0 circuits cannot compute parity - whether the number of 1s is odd. AC0 is the first level of the alternating-circuit hierarchy, and exactly which problems it contains can depend on the uniformity convention, a rule about how the circuits for different sizes must be generated.

AC0 is the class of problems decided by circuit families with one circuit per input length, of constant depth and polynomial size, over a Boolean basis of NOT together with AND and OR gates of unbounded fan-in. It is the base level of the AC hierarchy of alternating circuits. Unbounded fan-in means a single gate can aggregate arbitrarily many bits in one layer, while constant depth caps how many sequential rounds of logical interaction are possible, even though the circuit's total size may grow polynomially. The class is closed under standard Boolean composition. Its best-known limitation is that it cannot compute parity, under the usual uniform or nonuniform definitions. Uniformity - the condition on how easily the n-th circuit can be constructed - is a genuine parameter, so a precise claim states the circuit family, gate basis, depth and size bounds, fan-in, where negations are placed, and the uniformity convention.

Scope of Application¶

AC0 belongs to computational complexity and is useful where the analyst can specify the typed computational complexity carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the circuit family, Boolean basis, constant depth, polynomial size, unbounded fan-in, placement of negations and uniformity convention are explicit. The scope is broad within that domain but bounded by the need for the circuit family, Boolean basis, constant depth, polynomial size, unbounded fan-in, placement of negations and uniformity convention are explicit. 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 circuit family, Boolean basis, constant depth, polynomial size, unbounded fan-in, placement of negations and uniformity convention are explicit 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 AC0 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 AC0. AC0 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¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed computational complexity carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the circuit family, Boolean basis, constant depth, polynomial size, unbounded fan-in, placement of negations and uniformity convention are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of computational complexity because they reuse the typed computational complexity carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Each input length receives a shallow circuit; unbounded fan-in aggregates many bits per layer while the constant depth restricts sequential logical interaction despite polynomial total size., and type the carrier, state every parameter and convention in the definition, test that the circuit family, Boolean basis, constant depth, polynomial size, unbounded fan-in, placement of negations and uniformity convention are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction AC0 Domain-specific

Parents (1) — outgoing typed relations

AC0 is a kind of Complexity (Time/Space) Prime

It remains its own entry because its identity is fixed by the circuit family, Boolean basis, constant depth, polynomial size, unbounded fan-in, placement of negations and uniformity convention.

Hierarchy paths (5) — routes to 4 parentless roots

AC0 → is a kind of Complexity (Time/Space) → is a kind of Asymptotic Behavior → is a kind of Approximation → is a decomposition of Representation → presupposes Abstraction

Show alternative paths (4)

Neighborhood in Abstraction Space¶

AC0 sits in a crowded region of the domain-specific corpus (2^nd 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

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