Complex polynomials and circuit lower bounds for modular counting
From MaRDI portal
Publication:1346614
DOI10.1007/BF01263421zbMath0829.68045MaRDI QIDQ1346614
Howard Straubing, David A. Mix Barrington
Publication date: 6 April 1995
Published in: Computational Complexity (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
The correlation between parity and quadratic polynomials mod \(3\) ⋮ Complex polynomials and circuit lower bounds for modular counting ⋮ Exponential lower bound for bounded depth circuits with few threshold gates ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ An exact characterization of symmetric functions in \(qAC^{0}[2\)] ⋮ Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates ⋮ Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
Cites Work
This page was built for publication: Complex polynomials and circuit lower bounds for modular counting
