32bit Simplifier of Boolean functions
-
Updated
Dec 4, 2018 - C
32bit Simplifier of Boolean functions
A karnaugh map solver using C with Web interface
Simple implementation of Quine-McCluskey algorithm in C language.
The Quine-McCluskey algorithm simplifies Boolean functions by grouping and combining minterms that differ by one bit until no further reductions are possible, resulting in a minimal expression.
Add a description, image, and links to the quine-mccluskey-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the quine-mccluskey-algorithm topic, visit your repo's landing page and select "manage topics."