On shifting networks
From MaRDI portal
Publication:685361
DOI10.1016/0304-3975(93)90332-NzbMath0777.94025MaRDI QIDQ685361
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Communication in bounded depth circuits ⋮ On complexity of linear operators on the class of circuits of depth 2 ⋮ Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements ⋮ Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates ⋮ Min-rank conjecture for log-depth circuits ⋮ Entropy of operators or why matrix multiplication is hard for depth-two circuits ⋮ The complexity of depth-two information networks ⋮ Representing \((0,1)\)-matrices by Boolean circuits
Cites Work
This page was built for publication: On shifting networks
