On almost bad Boolean bases

DOI10.1016/0304-3975(94)00048-NMaRDI QIDQ1349706zbMATH OpenOpenAlexFDO

Authors Vladimir Stetsenko

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00048-n

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 4072877
• On the comparison of Boolean bases
• scientific article; zbMATH DE number 4049556
• On a class of bases for Boolean functions
• On the premaximal Boolean bases
• The complexity hierarchy of Boolean bases
• scientific article; zbMATH DE number 4049555
• On computation of Boolean involutive bases
• On Boolean bases of the second level
• Boolean algebra approximations

Cites work

• scientific article; zbMATH DE number 4008289 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 4045650 (Why is no real title available?)
• scientific article; zbMATH DE number 3737545 (Why is no real title available?)
• scientific article; zbMATH DE number 30214 (Why is no real title available?)
• scientific article; zbMATH DE number 51644 (Why is no real title available?)
• scientific article; zbMATH DE number 1142303 (Why is no real title available?)
• scientific article; zbMATH DE number 3248024 (Why is no real title available?)
• A method for obtaining more than quadratic effective lower estimates of complexity of schemes
• Complexity of the realization of a linear function in the class of -circuits
• The monotone circuit complexity of Boolean functions

Cited in

(5)

• The complexity hierarchy of Boolean bases
• On an infinite sequence of improving Boolean bases
• Critical properties and complexity measures of read-once Boolean functions
• Linear read-once and related Boolean functions
• Using relevance queries for identification of read-once functions

This page was built for publication: On almost bad Boolean bases

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