The reduction of general Boolean functions to monotonic form

MaRDI QIDQ1176917zbMATH OpenFDO

Authors S. I. Gurov

Publication date 25 June 1992

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

computational complexityBoolean functionmonotonic Boolean functionsmonotonic approximation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• Reductions for monotone Boolean circuits
• scientific article; zbMATH DE number 7300360 (Why is no real title available?)
• One approach to decoding monotone logical function
• Replaceability and computational equivalence for monotone boolean functions
• Functions computed by monotone Boolean formulas with no repeated variables

This page was built for publication: The reduction of general Boolean functions to monotonic form

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