-
Notifications
You must be signed in to change notification settings - Fork 0
Minimizes a given Boolean function using the Quine–McCluskey algorithm.
License
michaellandi/binarysimplification
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Anybody who has ever done binary simplification on more than four variables has probably used the Quine-McCluskey method of binary simplification. You also know how time consuming and error prone this process can be by hand. For a project in my Computer Architecture class I designed software which can perform the steps of binary simplification for you. Hopefully you can find this software as useful as I did!
About
Minimizes a given Boolean function using the Quine–McCluskey algorithm.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published