Hacker News new | past | comments | ask | show | jobs | submit login
Edward McCluskey has died (stanford.edu)
139 points by drallison on Feb 28, 2016 | hide | past | favorite | 6 comments



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).


> 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 ?


Ah good, I didn't know about them 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)


don-knuth (yes *that guy) has a fascicle here: http://www-cs-faculty.stanford.edu/~uno/fasc1b.ps.gz


Interesting, that was new to me. Can you recommend a BDD library forBoolean minimization? I'm specifically interested in three level minimization (AND, OR, XOR)


Rest in peace Edward McCluskey. It can't be overstated how much of breakthrough the Quine-McCluskey algorithm was for building computers. Logic synthesis programs used to design a computer's circuits would never have gotten off the ground without it.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: