Automata, Languages and Programming
From MaRDI portal
Publication:5716847
DOI10.1007/11523468zbMath1085.68061OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716847
Kristoffer Arnsfelt Hansen, Arkadev Chattopadhyay
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Exponential lower bound for bounded depth circuits with few threshold gates ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates ⋮ Depth Reduction for Circuits with a Single Layer of Modular Counting Gates ⋮ Near-optimal pseudorandom generators for constant-depth read-once formulas ⋮ Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
This page was built for publication: Automata, Languages and Programming
