scientific article; zbMATH DE number 3422273

zbMath0267.94036MaRDI QIDQ5684582

Nikolay P. Red'kin

Publication date: 1970

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

Mathematics Subject Classification ID

Related Items (10)

Lower bound of circuit complexity of parity function in a basis of unbounded fan-in ⋮ Models of lower-bounds proofs ⋮ Minimal contact circuits for symmetric threshold functions ⋮ A generalization of Shannon function ⋮ The minimal circuits for linear Boolean functions ⋮ The generalized complexity of linear Boolean functions ⋮ Implementation complexity of Boolean functions with a small number of ones ⋮ On the complexity of implementation of characteristic functions of the spheres by circuits of functional elements ⋮ Linear lower bounds on unbounded fan-in Boolean circuits ⋮ Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements

This page was built for publication: