Lower bounds for modular counting by circuits with modular gates

DOI10.1007/3-540-59175-3_81zbMath1495.68066OpenAlexW1553277864MaRDI QIDQ5096324

Howard Straubing, David A. Mix Barrington

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_81

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• \(NC^ 1\): The automata-theoretic viewpoint
• Non-uniform automata over groups
• \(\Sigma_ 1^ 1\)-formulae on finite structures
• On the computational power of depth 2 circuits with threshold and modulo gates
• Parity, circuits, and the polynomial-time hierarchy
• Harmonic Analysis of Polynomial Threshold Functions
• CONSTANT-DEPTH PERIODIC CIRCUITS

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