This program is designed to visualize the minimization of Boolean functions. The Quine–McCluskey algorithm is used for the minimization. The visualization is demonstrated on the Karnaugh map and the Boolean n-cube.

The project is also hosted on Google Code.

Posts
Bmin 1.0.1
This program is designed to visualize the minimization of Boolean functions. The Quine–McCluskey algorithm is used for the minimization. The visualization is demonstrated on the Karnaugh map and the Boolean n-cube. The project is also hosted on Google Code.
Bmin 1.0.0
This program is designed to visualize the minimization of Boolean functions. The Quine–McCluskey algorithm is used for the minimization. The visualization is demonstrated on the Karnaugh map and the Boolean n-cube. The project is also hosted on Google Code.
Bmin 0.6.0
This program is designed to visualize the minimization of Boolean functions. The Quine–McCluskey algorithm is used for the minimization. The visualization is demonstrated on the Karnaugh map and the Boolean n-cube. The project is also hosted on Google Code.
Bmin 0.5.0
This program is designed to visualize the minimization of Boolean functions. The Quine–McCluskey algorithm is used for the minimization. The visualization is demonstrated on the Karnaugh map and the Boolean n-cube. The project is also hosted on Google Code.
Bmin 0.4.0
This program is designed to visualize the minimization of Boolean functions. The Quine–McCluskey algorithm is used for the minimization. The visualization is demonstrated on the Karnaugh map and the Boolean n-cube. The project is also hosted on Google Code.
Bmin 0.3.0
This program is designed to visualize the minimization of Boolean functions. The Quine–McCluskey algorithm is used for the minimization. The visualization is demonstrated on the Karnaugh map and the Boolean n-cube. The project is also hosted on Google Code.