Abstract
ABSTRACT A new algorithm is shown that generates the representation of completely or incompletely specified boolean functions in the form of arrays of disjoint ON- and DC- ( if any) cubes. A peculiar feature of the algorithm, which speeds up its execution, is the fact that in comparison to known algorithms it minimizes the number of usages of cube calculus operations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.