Majority versus ACC^0

Determine whether the Majority function belongs to the circuit class $ACC^0$.

Background

The paper situates torus-polynomial approximation within the broader program of proving lower bounds against ACC0ACC^0, the class of polynomial-size, constant-depth circuits with modular gates. Although prior work established important lower bounds for specific modular circuit classes and related complexity separations, the membership status of Majority in ACC0ACC^0 remains unresolved. A resolution would clarify whether ACC0ACC^0 circuits can compute Majority and would address a central challenge in circuit complexity.

References

A major open question is whether the Majority function is in $ACC0$.

— Majority and Torus Polynomials: Bounded-Lift Lower Bounds and Explicit Constructions  (2610.19174 - Wesonga, 13 Oct 2026) in Section 1, Introduction