scientific article; zbMATH DE number 6460060

MaRDI QIDQ5263827zbMATH OpenFDO

Authors Yu. A. Kombarov

Publication date 17 July 2015

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

zbMATH Keywords

Sheffer strokeBoolean circuitparity function

Mathematics Subject Classification ID

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

Recommendations

• The minimal circuits for linear Boolean functions
• On minimal realizations of linear Boolean functions
• On minimal circuits for linear functions over some bases
• On minimal \(\pi\)-schemes for linear Boolean functions
• Complexity of realization of a linear Boolean function in Sheffer's basis
• Minimal contact circuits for a sequence of Boolean functions
• MINIMIZATION OF REPRESENTATIONS OF THE LOGICAL FUNCTION IN SCHAEFFER AND PIERCE BASES
• scientific article; zbMATH DE number 2210682
• Asymptotically minimal schemes for one sequence of Boolean functions
• scientific article; zbMATH DE number 2095572

Cited in

(11)

• Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
• New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial
• scientific article; zbMATH DE number 4068789 (Why is no real title available?)
• The minimal circuits for linear Boolean functions
• Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
• Complexity and structure of circuits for parity functions
• On minimal realizations of linear Boolean functions
• A shortest 2-basis for Boolean algebra in terms of the Sheffer stroke
• Complexity of realization of a linear Boolean function in Sheffer's basis
• The generalized complexity of linear Boolean functions
• On minimal circuits for linear functions over some bases

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 Q5263827)