Lower bounds for modular counting by circuits with modular gates

DOI10.1007/s000370050030zbMath0966.68076OpenAlexW2026143994MaRDI QIDQ1590077

Howard Straubing, David A. Mix Barrington

Publication date: 19 December 2000

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050030

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Correlation lower bounds from correlation upper bounds ⋮ A topological approach to non-uniform complexity ⋮ Depth Reduction for Circuits with a Single Layer of Modular Counting Gates

This page was built for publication: Lower bounds for modular counting by circuits with modular gates