Symmetric MOD_m circuits require subexponential size to compute n-ary AND, with the bound matched by known depth-2 constructions.
‘Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations’
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Lower Bounds for Symmetric Modular Circuits
Symmetric MOD_m circuits require subexponential size to compute n-ary AND, with the bound matched by known depth-2 constructions.