Complexity of realization of a linear Boolean function in Sheffer's basis

DOI10.3103/S0027132213020083MaRDI QIDQ355321zbMATH OpenFDO

Authors Yu. A. Kombarov

Publication date 24 July 2013

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

Sheffer strokelinear Boolean functionsrealization by circuits of functional elements

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Recommendations

• scientific article; zbMATH DE number 6460060
• On minimal realizations of linear Boolean functions
• The minimal circuits for linear Boolean functions
• The generalized complexity of linear Boolean functions
• On the complexity of realization of the linear function by formulas over finite Boolean bases

Cites work

• scientific article; zbMATH DE number 2095572 (Why is no real title available?)
• The minimal circuits for linear Boolean functions

Cited in

(7)

• scientific article; zbMATH DE number 4068789 (Why is no real title available?)
• scientific article; zbMATH DE number 6460060 (Why is no real title available?)
• Realization of linear functions by formulas in various bases
• On minimal realizations of linear Boolean functions
• A shortest 2-basis for Boolean algebra in terms of the Sheffer stroke
• The generalized complexity of linear Boolean functions
• Polynomial-time quantum algorithms for finding the linear structures of Boolean function

This page was built for publication: Complexity of realization of a linear Boolean function in Sheffer's basis

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