Abstract
Boolean functions with a small number of zeros are studied. A linear algorithm for constructing a dead-end disjunctive normal form (DNF) is obtained for a function of special form from this class. The resulting dead-end DNF insignificantly differs from theoretical estimates for the minimal DNF.
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 callDisclaimer: 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.
