AC (complexity)¶
A circuit-complexity hierarchy of languages decidable by polynomial-size, polylogarithmic-depth Boolean circuits with unbounded-fan-in AND and OR gates.
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..
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¶
- 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) — more general patterns this builds on
-
AC (complexity) is a kind of Complexity Prime
The proposed strict upward parent is
prime:complexity.
Hierarchy path (1) — routes to 1 parentless root
- AC (complexity) → Complexity
Neighborhood in Abstraction Space¶
AC (complexity) sits in a crowded region of the domain-specific corpus (36th 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
- 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-09-08