Generation of Boolean functions under the assumption of monotonicity

DOI10.3103/S0278641913010056zbMATH Open1286.06025MaRDI QIDQ357919FDOQ357919

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)

Recommendations

• scientific article
• 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

zbMATH Keywords

universal functionmonotonic functiongeneration of a function

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Cites Work

• On universal partial functions for a set of linear functions.
• Title not available (Why is that?)

Cited In (8)

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

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)