scientific article; zbMATH DE number 3358361
From MaRDI portal
Publication:5632463
zbMath0225.94026MaRDI QIDQ5632463
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Lower bound of circuit complexity of parity function in a basis of unbounded fan-in ⋮ Complexity and structure of circuits for parity functions ⋮ The minimal circuits for linear Boolean functions ⋮ The generalized complexity of linear Boolean functions ⋮ Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
This page was built for publication: