Symmetric MOD_m circuits require subexponential size to compute n-ary AND, with the bound matched by known depth-2 constructions.
Mix Barrington, Howard Straubing and Denis Th´ erien
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A new algebraic framework characterizes language classes recognized by circuits over simple algebras and congruence modular varieties.
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.
-
Complexity Classes Arising from Circuits over Finite Algebraic Structures
A new algebraic framework characterizes language classes recognized by circuits over simple algebras and congruence modular varieties.