Implementation of Quine McCluskey algorithm in Python 3
32bit Simplifier of Boolean functions
C++ implementation of Quine-McCluskey and Petrick's method to simplify boolean expressions
A complete code of Quine mccluskey and patrick’s method with each steps
Flask app that uses Quine-McCluskey/Petrick's algorithms to find least-cost boolean expressions
Karnaugh map solver
Quine-McCluskey boolean function minimizer for Kotlin
Minimize Boolean functions using Quine-McCluskey and Petrick's algorithm.
The Quine-McCluskey algorithm is a method used to simplify boolean expressions. This is an implementation of the algorithm using Python.
Propositional logic evaluator and Boolean minimizer with parser, AST, truth tables, Quine-McCluskey, Petrick’s Method, and Karnaugh maps.
A really useful tool to reduce logic functions on your digital circuits using Petrick's Method.
Implementing Quine-McCluskey and Petrick methods to compute the minimization of a Boolean function
Verified Quine-McCluskey and Petrick Boolean minimizer with bounded exact prime-cover search.
To associate your repository with the petrick-method topic, visit your repo's landing page and select "manage topics."