Publication:5656695
From MaRDI portal
zbMath0244.94022MaRDI QIDQ5656695
Publication date: 1971
94C11: Switching theory, applications of Boolean algebras to circuits and networks
Related Items
Separating OR, SUM, and XOR circuits, An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution, On the complexity of slice functions, More on the complexity of slice functions, Some remarks on Boolean sums, On another Boolean matrix, Boolean functions whose monotone complexity is of size \(n^ 2\) / log n, A very simple function that requires exponential size read-once branching programs.