Boolean Minimization 0.9
Developed by Armin Randjbar-Daemi, listed in Algorithm
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: 5 years, 2 months ago | Last updated: 2 years, 4 months 26 days ago
More popular Algorithm
- Love Calculator 1.0 (2 years, 4 months 25 days ago)
- Binary Tree Algorithms 1.0 (2 years, 4 months 25 days ago)
- Fast Fourier Transform 0.1 (2 years, 4 months 26 days ago)
- Kruskal 1.0 (7 years, 7 months 18 days ago)
- RCD Script 1.0 (2 years, 4 months 25 days ago)
This is actually one of the most advanced image hosting script. The imagetize key features: SEO, Ads Ready, Admin
Listing Files

Minimization.class.php- 4.3 KB
- 03/24/2008 18:58:14

index.php- 1.0 KB
- 03/24/2008 18:58:14

Chronometer.php- 467 Bytes
- 03/24/2008 18:58:14
Hot Scripts
Sponsors
- FREE MySQL Cloud Database Super Simple, Zero-Management MySQL Cloud DB. Use It FREE!
- Pinterest clone Start your own pin board social network today. Get Pintastic and start your own pinterest clone network.
- MYRE Real Estate Software Professional Real Estate solutions by MYREPHP PROGRAMMING!
