Generation of Boolean functions under the assumption of monotonicity

DOI10.3103/S0278641913010056MaRDI QIDQ357919zbMATHFDO

Authors A. A. Voronenko, V. S. Fedorova

Publication date 15 August 2013

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

universal functionmonotonic functiongeneration of a function

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 4204284
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• Monotone Boolean functions
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• scientific article; zbMATH DE number 4055688

Cites work

• scientific article; zbMATH DE number 3304025 (Why is no real title available?)
• On universal partial functions for a set of linear functions.

Cited in

(8)

• Functions computed by monotone Boolean formulas with no repeated variables
• A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
• scientific article; zbMATH DE number 2174392 (Why is no real title available?)
• On the generation of false images of linear Boolean functions
• On a property of linear Boolean functions
• On the length of a read-many certificate in certain extended elementary bases
• Generation of mutants for boolean expression
• Generation of images of several literals

This page was built for publication: Generation of Boolean functions under the assumption of monotonicity

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