scientific article; zbMATH DE number 3358361

MaRDI QIDQ5632463zbMATH OpenFDO

Authors Nikolay P. Red'kin

Publication date 1971

Mathematics Subject Classification ID

Cited in

(5)

• Complexity and structure of circuits for parity functions
• Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
• The generalized complexity of linear Boolean functions
• The minimal circuits for 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:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5632463)