scientific article; zbMATH DE number 609986

MaRDI QIDQ4301459zbMATH OpenFDO

Authors V. A. Stetsenko

Publication date 1 February 1995

zbMATH Keywords

Boolean functionspreorderpreworst basis

Mathematics Subject Classification ID

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

Recommendations

• On the premaximal Boolean bases
• On some series of bases for the set of Boolean functions
• scientific article; zbMATH DE number 30214
• On a class of bases for Boolean functions
• An algorithmic criterion for the comparison of Boolean bases.

Cited in

(12)

• Iterated Boolean functions in the elementary basis
• A new proof of Stetsenko's theorem
• Testing of read-once functions in extended elementary bases
• The length of a read-many certificate in the basis of all functions of l variables
• On some series of bases for the set of Boolean functions
• scientific article; zbMATH DE number 30214 (Why is no real title available?)
• On the premaximal Boolean bases
• scientific article; zbMATH DE number 7310075 (Why is no real title available?)
• An algorithmic criterion for the comparison of Boolean bases.
• On an infinite sequence of improving Boolean bases
• Learning read once functions using subcube parity queries
• On the length of a read-many certificate in certain extended elementary 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 Q4301459)