scientific article; zbMATH DE number 139645

MaRDI QIDQ4029626zbMATH OpenFDO

Authors N. A. Shkalikova

Publication date 28 March 1993

zbMATH Keywords

Boolean functionscomplexity of the Shannon functionplanar schemesswitching schemes

Mathematics Subject Classification ID

Review text

[For the entire collection see Zbl 0745.00057.] The paper studies switching schemes based on conjunctions, disjunctions, negations and identify functions. In an earlier paper S. Kravtsov has evaluated the order of the complexity of the Shannon function in the case of planar schemes. The present paper provides exact estimates for the complexity for some special classes of Boolean functions.

Recommendations

• scientific article; zbMATH DE number 4097290
• On complexity of schemes in incomplete bases
• scientific article; zbMATH DE number 23021
• scientific article; zbMATH DE number 4047105
• On the complexity of schemes in an infinite basis

Cited in

(10)

• Generalization of cardinality estimates for plane circuits realizing partial Boolean operators
• Order of power of planar circuits implementing Boolean functions
• Conditions for realization of a function on a semilattice over real bases of switching elements
• scientific article; zbMATH DE number 4176991 (Why is no real title available?)
• scientific article; zbMATH DE number 4137716 (Why is no real title available?)
• scientific article; zbMATH DE number 4091416 (Why is no real title available?)
• scientific article; zbMATH DE number 139638 (Why is no real title available?)
• scientific article; zbMATH DE number 1294417 (Why is no real title available?)
• scientific article; zbMATH DE number 647645 (Why is no real title available?)
• On a model of plane contact schemes

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