scientific article; zbMATH DE number 609986

zbMATH Open0805.06015MaRDI QIDQ4301459FDOQ4301459

Authors: V. A. Stetsenko 

Publication date: 1 February 1995

Title of this publication is not available (Why is that?)

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.

zbMATH Keywords

Boolean functionspreorderpreworst basis

Mathematics Subject Classification ID

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

Cited In (11)

• The length of a read-many certificate in the basis of all functions of \(l\) variables
• A new proof of Stetsenko's theorem
• On the premaximal Boolean bases
• Iterated Boolean functions in the elementary basis
• Title not available (Why is that?)
• Testing of read-once functions in extended elementary bases
• On an infinite sequence of improving Boolean bases
• On some series of bases for the set of Boolean functions
• On the length of a read-many certificate in certain extended elementary bases
• An algorithmic criterion for the comparison of Boolean bases.
• Learning read once functions using subcube parity queries

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)