On complexity of linear operators on the class of circuits of depth 2
From MaRDI portal
Publication:3184524
DOI10.1515/DMA.2008.011zbMath1172.94655MaRDI QIDQ3184524
Publication date: 21 October 2009
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- On shifting networks
- Communication in bounded depth circuits
- Linear Circuits over $\operatorname{GF}(2)$
- Boolean Circuits, Tensor Ranks, and Communication Complexity
- Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
This page was built for publication: On complexity of linear operators on the class of circuits of depth 2
