On an infinite sequence of improving Boolean bases

DOI10.1016/S0166-218X(00)00362-0MaRDI QIDQ5954084zbMATH OpenFDO

Authors D. U. Cherukhin

Publication date 19 August 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-218X(00)00362-0

zbMATH Keywords

Boolean functionBoolean functionscomplexity of formulasfinite complete bases

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the comparison of Boolean bases
• On the complexity of realization of the linear function by formulas over finite Boolean bases
• On almost bad Boolean bases
• scientific article; zbMATH DE number 4072877
• The complexity hierarchy of Boolean bases

Cited in

(5)

• Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits
• scientific article; zbMATH DE number 4061230 (Why is no real title available?)
• scientific article; zbMATH DE number 4072877 (Why is no real title available?)
• On the premaximal Boolean bases
• On the complexity of realization of the linear function by formulas over finite Boolean bases

This page was built for publication: On an infinite sequence of improving Boolean bases

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