scientific article; zbMATH DE number 139638

zbMATH Open0767.94025MaRDI QIDQ4029618FDOQ4029618

Authors: N. N. Kuzyurin 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

complexityBoolean functioncontact schemesschemes with functional elements

Mathematics Subject Classification ID

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
• Title not available (Why is that?)
• Depth of \(\alpha\)-completions of systems of Boolean functions.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity and structure of near-minimal contact circuits for elementary symmetric functions
• 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)