On the premaximal Boolean bases

DOI10.1515/DMA.1999.9.3.295MaRDI QIDQ4522823zbMATH OpenOpenAlexFDO

Authors D. Yu. Cherukhin

Publication date 30 September 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1999.9.3.295

zbMATH Keywords

Boolean functioncomplexityincomparable Boolean basespremaximal Boolean basis

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 30214
• scientific article; zbMATH DE number 609986
• An algorithmic criterion for the comparison of Boolean bases.
• On the comparison of Boolean bases
• On some series of bases for the set of Boolean functions
• On an infinite sequence of improving Boolean bases
• Realization of linear functions by formulas in various bases
• scientific article; zbMATH DE number 4072877
• The complexity hierarchy of Boolean bases
• Complexity of implementation of Boolean functions by real-valued formulas

Cited in

(6)

• On almost bad Boolean bases
• On some series of bases for the set of Boolean functions
• scientific article; zbMATH DE number 30214 (Why is no real title available?)
• scientific article; zbMATH DE number 609986 (Why is no real title available?)
• scientific article; zbMATH DE number 3995639 (Why is no real title available?)
• An algorithmic criterion for the comparison of Boolean bases.

This page was built for publication: On the premaximal Boolean bases

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