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.
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.
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. 2. 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) — more general patterns this builds on
-
AC0 is a kind of Complexity (Time/Space) Prime
The proposed strict upward parent is
prime:complexity_time_space.
Hierarchy paths (5) — routes to 4 parentless roots
Neighborhood in Abstraction Space¶
AC0 sits in a crowded region of the domain-specific corpus (4th 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 & Reductions (22 abstractions)
Nearest neighbors
- AC (complexity) — 0.95
- SC (complexity) — 0.94
- Arithmetic circuit complexity — 0.94
- Parity P — 0.93
- Boolean hierarchy — 0.93
Computed from structural-signature embeddings · 2026-09-08