Hacker News Reader

EE/CS here. Kmaps only work for 4-5 variables unless you're some sort of 4D-chess wizard. And they're meant for manual, human pattern-matching rather than automated evaluation.

There are numerous, specialized bi/tri/quad boolean logic prime implicant optimization algorithms for combinational logic and expressions like QM and MQM.

I once did the reverse karnaugh mapping on a set of expressions to minimize their complexity; the input set was 7 bits.

Specifically, I created an instruction mapping on a 7b opcode space such that the decode logic for the critical paths was short (eg, branch decode). It took multiple sheets of paper, a few tries, and a couple of days, but it wasn't too bad.

For my bachelors thesis I built a tool for playing around with and teaching KV diagrams [1]

[1]: https://thesis.laszlokorte.de/demo/kvd-editor.html

Nice tool! By DNF and KNF do you mean disjunctive and conjuctive normal form?

Correct. In german it's called "Konjunktive Normalform" and targetted at a german class I decided not to translate it.

Also Quine-McCluskey for an automated reduction of Karnaugh maps.