Publication:3412385
From MaRDI portal
zbMath1104.94066MaRDI QIDQ3412385
Publication date: 5 December 2006
06E30: Boolean functions
Related Items
Min-rank conjecture for log-depth circuits, Entropy of operators or why matrix multiplication is hard for depth-two circuits, Representing \((0,1)\)-matrices by Boolean circuits, The complexity of depth-two information networks, Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates