scientific article; zbMATH DE number 30214

MaRDI QIDQ3985300zbMATH OpenFDO

Authors V. A. Stetsenko

Publication date 27 June 1992

zbMATH Keywords

complexity of a formulapremaximal basistruth functions

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Boolean functions (06E30)

Recommendations

• On the premaximal Boolean bases
• scientific article; zbMATH DE number 609986
• An algorithmic criterion for the comparison of Boolean bases.

Cited in

(9)

• On almost bad Boolean bases
• The maximal cardinality of the base in \(P_2\times P_2 \)
• scientific article; zbMATH DE number 3875273 (Why is no real title available?)
• scientific article; zbMATH DE number 4012624 (Why is no real title available?)
• scientific article; zbMATH DE number 130881 (Why is no real title available?)
• scientific article; zbMATH DE number 609986 (Why is no real title available?)
• On the premaximal Boolean bases
• scientific article; zbMATH DE number 2147778 (Why is no real title available?)
• An algorithmic criterion for the comparison of Boolean bases.

This page was built for publication:

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