scientific article; zbMATH DE number 3387244

zbMath0244.94022MaRDI QIDQ5656695

È. I. Nechiporuk

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items

Separating OR, SUM, and XOR circuits, 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., An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution, On the complexity of slice functions