An algorithmic criterion for the comparison of Boolean bases.

MaRDI QIDQ5445408zbMATH OpenFDO

Authors D. Yu. Cherukhin

Publication date 5 March 2008

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• On some series of bases for the set of Boolean functions
• On the premaximal Boolean bases
• The complexity hierarchy of Boolean bases
• scientific article; zbMATH DE number 30214
• scientific article; zbMATH DE number 609986

Cited in

(11)

• Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits
• Read-once functions of the algebra of logic in pre-elementary bases
• On some series of bases for the set of Boolean functions
• scientific article; zbMATH DE number 4204341 (Why is no real title available?)
• scientific article; zbMATH DE number 4049556 (Why is no real title available?)
• scientific article; zbMATH DE number 4072877 (Why is no real title available?)
• scientific article; zbMATH DE number 4104874 (Why is no real title available?)
• scientific article; zbMATH DE number 30214 (Why is no real title available?)
• scientific article; zbMATH DE number 609986 (Why is no real title available?)
• On the premaximal Boolean bases
• On a quasi-ordering on Boolean functions

This page was built for publication: An algorithmic criterion for the comparison of Boolean bases.

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