scientific article; zbMATH DE number 6460060

zbMath1324.94068MaRDI QIDQ5263827

Yu. A. Kombarov

Publication date: 17 July 2015

Full work available at URL: http://mathnet.ru/eng/da740

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

zbMATH Keywords

parity functionSheffer strokeBoolean circuit

Mathematics Subject Classification ID

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

Related Items (4)

Lower bound of circuit complexity of parity function in a basis of unbounded fan-in ⋮ Complexity and structure of circuits for parity 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: