scientific article; zbMATH DE number 139638

MaRDI QIDQ4029618zbMATH OpenFDO

Authors N. N. Kuzyurin

Publication date 28 March 1993

zbMATH Keywords

complexityBoolean functioncontact schemesschemes with functional elements

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 23021
• scientific article; zbMATH DE number 4068270
• scientific article; zbMATH DE number 4097290
• scientific article; zbMATH DE number 139645
• Computational complexity of Boolean functions

Cited in

(11)

• A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice
• scientific article; zbMATH DE number 4187719 (Why is no real title available?)
• Depth of \(\alpha\)-completions of systems of Boolean functions.
• scientific article; zbMATH DE number 4176991 (Why is no real title available?)
• scientific article; zbMATH DE number 23021 (Why is no real title available?)
• scientific article; zbMATH DE number 4097290 (Why is no real title available?)
• scientific article; zbMATH DE number 4095387 (Why is no real title available?)
• scientific article; zbMATH DE number 5373691 (Why is no real title available?)
• Complexity and structure of near-minimal contact circuits for elementary symmetric functions
• scientific article; zbMATH DE number 4189653 (Why is no real title available?)
• On the complexity of realizations of Boolean functions in some classes of hypercontact circuits

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