A karnaugh map solver using C with Web interface

Karnaugh map Solver Application Tool, used to find the minimal sum of products of three variable or four variable boolean equations.

Boolean Function Analyzer and Synthesis Optimization Tool

K map solver up to 4 variables, built using python

Python based projects done as part of core courses at IIITD

logic design and digital circuits mini project

This project contains Java code to implement a Kmap solver, limited to 3 variables. On entering the truth table or minterms, it gives the minimal SOP form, using 3-variable K-map as the minimization technqiue.

Karnaugh maps solver is a web app that takes the truth table of a function as input, transposes it onto the respective Karnaugh map and finds the minimum forms SOP and POS according to the visual resolution method by Maurice Karnaugh, American physicist and mathematician. Implementation of the Quine - McKlusky algorithm in C++

Boolean minimization using Karnaugh maps. Works for any number of bits >3.