A C++ implementation of the Quine-McCluskey algorithm.
-
Updated
Sep 18, 2023 - C++
A C++ implementation of the Quine-McCluskey algorithm.
Boolean function minimizer based on Quine–McCluskey algorithm.
AGH University of science and technology - Python Labs - Project 1: Quine–McCluskey Algorithm
Minimize Boolean functions using Quine-McCluskey and Petrick's algorithm.
A Python-based Boolean Expression evaluator and simplifier.
Quine-McCluskey boolean function minimizer for Kotlin
Resolution of algorithm of Quine Mc Cluskey
The Quine-McCluskey algorithm is a method used to simplify boolean expressions. This is an implementation of the algorithm using Python.
software implementation of the tabular method (Quine-McCluskey) to minimize boolean expressions
This is an Android Application project using Java. Quine-McCluskey Tabulation was implemented by the project.
Takes in either a boolean algebraic expression, a sum of minterms expression or a product of maxterms expression and produces the simplest SOP, POS and truth tables and, optionally, the K-Map using Quine-McCluskey
Boolean Function Analyzer and Synthesis Optimization Tool
C++ implementation of Quine-McCluskey and Petrick's method to simplify boolean expressions
Flask app that uses Quine-McCluskey/Petrick's algorithms to find least-cost boolean expressions
Rust learning project based on Quine-Mc.Cluskey logic method
Add a description, image, and links to the quine-mccluskey topic page so that developers can more easily learn about it.
To associate your repository with the quine-mccluskey topic, visit your repo's landing page and select "manage topics."