Abstract
An algorithm is proposed for constructing reduced disjunctive normal forms (DNF) of Boolean functions given with zero sets wthat is most effective for a small number of zeros. Sufficiently accurate constructive upper estimates are obtained for the length of the shortest DNFs and the complexity of the minimum DNFs of almost all Boolean functions with a small number of zeros.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: USSR Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
