On realization complexity of linear Boolean transformations by schemes of depth 3

MaRDI QIDQ1406385zbMATH OpenFDO

Authors K. A. Zykov

Publication date 4 September 2003

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

zbMATH Keywords

linear Boolean transformationsschemes of depth 3

Mathematics Subject Classification ID

Recommendations

• On the comparison of complexity of two ways of realization of some linear Boolean functions
• Publication:4729729
• scientific article; zbMATH DE number 4097288
• Complexity of the realization of a linear Boolean function in the class of \(\pi\)-schemes
• scientific article; zbMATH DE number 4081452

Cited in

(9)

• scientific article; zbMATH DE number 4097288 (Why is no real title available?)
• scientific article; zbMATH DE number 3968581 (Why is no real title available?)
• scientific article; zbMATH DE number 4114559 (Why is no real title available?)
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
• On the complexity of linear Boolean operators with thin matrices
• The complexity of the realization of subdefinite matrices by gate schemes
• Rectifier circuits of bounded depth
• scientific article; zbMATH DE number 4081452 (Why is no real title available?)
• scientific article; zbMATH DE number 3981870 (Why is no real title available?)

This page was built for publication: On realization complexity of linear Boolean transformations by schemes of depth 3

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