Processes boolean functions which can be provided either as a list of 0s and 1s or which can be provided as a formula in first-order logic (using disjunctive or conjunctive normal forms). Internally the Quine McCluskey algorithm is used.

Project Activity

See All Activity >

License

GNU General Public License version 2.0 (GPLv2)

Follow The Boolfreak Minimizer

The Boolfreak Minimizer Web Site

Other Useful Business Software
$300 Free Credits to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of The Boolfreak Minimizer!

Additional Project Details

Languages

English

Intended Audience

Advanced End Users, Developers, Information Technology, Science/Research

User Interface

Command-line

Programming Language

Java, Python

Related Categories

Python Electronic Design Automation (EDA) Software, Java Electronic Design Automation (EDA) Software

Registered

2006-09-19