On the comparison of Boolean bases

zbMATH Open0958.06009MaRDI QIDQ1594495FDOQ1594495

Authors: D. Yu. Cherukhin 

Publication date: 28 January 2001

Published in: Doklady Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4072877
• scientific article; zbMATH DE number 4049556
• On some series of bases for the set of Boolean functions
• scientific article; zbMATH DE number 3970686
• The complexity hierarchy of Boolean bases

zbMATH Keywords

Boolean functionsBoolean basescomplexity of a formula

Mathematics Subject Classification ID

Boolean functions (06E30)

Cited In (21)

• Title not available (Why is that?)
• Boole vs Wadge: comparing two basic tools of descriptive set theory
• Comparison of Boolean algebras
• On almost bad Boolean bases
• The complexity hierarchy of Boolean bases
• On the premaximal Boolean bases
• On the complexity of joint realization of Boolean functions regular systems in the DNF basis
• On an infinite sequence of improving Boolean bases
• Title not available (Why is that?)
• On the construction of parallel computers from various basis of Boolean functions
• Complexity of implementation of Boolean functions by real-valued formulas
• On a class of bases for Boolean functions
• Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
• Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits
• Title not available (Why is that?)
• Permutation and phase independent Boolean comparison
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of realization of the linear function by formulas over finite Boolean bases

This page was built for publication: On the comparison of Boolean bases

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