Boolean Minimization 0.9

Boolean Minimization can be used to minimize boolean expressions using base 3 matrix. It takes as parameters minterms and variables. It performs boolean minimization and returns the prime implicants as a class array variable.

Boolean Minimization uses the principle that any combination of causal conditions is a line number in the base 3 matrix. Also a prime implicant produced by minimizing two other combinations, is itself a line number in the base 3 matrix.

This algorithm does not use bit by bit binary comparison, so it is faster than the classic Quine-McCluskey method.

License type: GNU General Public License
Date added: 6 years, 4 months 2 days ago | Last updated: 3 years, 6 months 28 days ago

More popular Algorithm

This is actually one of the most advanced image hosting script. The imagetize key features: SEO, Ads Ready, Admin

Listing Files

Hot Scripts