3 ms·
Should be McCluskey in the title. He's one half of the Quine-McCluskey algorithm, an efficient algorithm that basically does what a Karnaugh map can do (minimi
by weinzierl 11y ago
Should be McCluskey in the title. He's one half of the Quine-McCluskey algorithm, an efficient algorithm that basically does what a Karnaugh map can do (minimization of boolean functions).
- signa11 11y ago> an efficient algorithm that basically does what a Karnaugh map can do i was under the impression that BDD's are the current state of the art for minimization of boolean-functions. no ?
- raverbashing 11y agoAh good, I didn't know about them https://en.wikipedia.org/wiki/Binary_decision_diagram https://en.wikipedia.org/wiki/Binary_decision_diagram It seems the issue is that BDDs are more modern and more easily computed automatically (Funnily enough neither Karnaugh maps or the QMC page point to BDDs except in an external link)
- signa11 11y agodon-knuth (yes *that guy) has a fascicle here: http://www-cs-faculty.stanford.edu/~uno/fasc1b.ps.gz http://www-cs-faculty.stanford.edu/~uno/fasc1b.ps.gz
- weinzierl 11y agoInteresting, that was new to me. Can you recommend a BDD library forBoolean minimization? I'm specifically interested in three level minimization (AND, OR, XOR)