Abstract
An algorithm for minimising Boolean polynomials is developed. The algorithm can be programmed conveniently and although it makes use of existing knowledge of minimising methods, the algorithm is novel in that it involves no expansion of the number of terms of the polynomial other than by one term which is dropped before the next stage of the algorithm is reached
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 callSimilar Papers
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.
