On the complexity of reducing weakly positive and weakly negative Boolean functions

MaRDI QIDQ5117014zbMATH OpenFDO

Authors S. P. Gorshkov

Publication date 20 August 2020

Full work available at URL http://mathnet.ru/eng/pdm2

Mathematics Subject Classification ID

Boolean functions (06E30) Boolean functions (94D10)

Recommendations

• About some properties of Horn and anti-Horn functions
• On the positive and the inversion complexity of Boolean functions
• scientific article; zbMATH DE number 4204284
• Publication:3470419
• scientific article; zbMATH DE number 3970686

Cited in

(5)

• Boolean functions with a simple certificate for CNF complexity
• On the positive and the inversion complexity of Boolean functions
• On weak positive predicates over a finite set
• About some properties of Horn and anti-Horn functions
• Computation of the additivity coefficient of some bijunctive, weakly positive and weakly negative Boolean functions

This page was built for publication: On the complexity of reducing weakly positive and weakly negative Boolean functions

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