Editing Quine–McCluskey algorithm (section)

== Further reading==
* {{cite book |title=A new approach to the design of switching circuits |author-first=Herbert Allen |author-last=Curtis |chapter=Chapter 2.3. McCluskey's Method |publisher=[[D. van Nostrand Company, Inc.]] |date=1962 |location=Princeton, New Jersey, USA |edition=1 |series=The Bell Laboratories Series |s2cid=57068910 |oclc=1036797958 |isbn=0-44201794-4 |id={{ISBN|978-0-44201794-1}}. ark:/13960/t56d6st0q <!-- |ia=newapproachtodes00curt --> |pages=90–160}} (viii+635 pages) (NB. This book was reprinted by Chin Jih in 1969.)
* {{cite journal |first=Olivier |last=Coudert |title=Two-level logic minimization: an overview |journal=Integration, the VLSI Journal |issn=0167-9260 |volume=17-2 |date=October 1994 |issue=2 |pages=97–140 |doi=10.1016/0167-9260(94)00007-7 |url=https://oliviercoudert.files.wordpress.com/2020/11/int94.pdf |access-date=2020-05-10 |url-status=live |archive-url=https://web.archive.org/web/20200510214647/http://www.ocoudert.com/papers/pdf/int94.pdf |archive-date=2020-05-10}} (47 pages)
* {{cite arXiv |title=Modified Quine-McCluskey Method |first1=Vitthal |last1=Jadhav |first2=Amar |last2=Buchade |date=2012-03-08  |class=cs.OH |eprint=1203.2289}} (4 pages)
* {{cite web |title=All about Quine-McClusky |first=Jack |last=Crenshaw |date=2004-08-19 |website=embedded.com |url=http://www.embedded.com/electronics-blogs/programmer-s-toolbox/4025004/All-about-Quine-McClusky |access-date=2020-05-10 |url-status=live |archive-url=https://web.archive.org/web/20200510215306/https://www.embedded.com/all-about-quine-mcclusky/ |archive-date=2020-05-10}}
* {{cite journal |last1=Tomaszewski |first1=Sebastian P. |last2=Celik |first2=Ilgaz U. |last3=Antoniou |first3=George E. |title=WWW-based Boolean function minimization |journal=[[International Journal of Applied Mathematics and Computer Science]] |volume=13 |issue=4 |date=December 2003 |orig-date=2003-03-05, 2002-04-09 |pages=577–584 |url=http://matwbn.icm.edu.pl/ksiazki/amc/amc13/amc13414.pdf |access-date=2020-05-10 |url-status=live |archive-url=https://web.archive.org/web/20200510214937/http://matwbn.icm.edu.pl/ksiazki/amc/amc13/amc13414.pdf |archive-date=2020-05-10}} [https://www.researchgate.net/publication/228862329_WWW-based_Boolean_function_minimization][https://archive.today/20180115131301/http://matwbn.icm.edu.pl/ksiazki/amc/amc13/amc13414.pdf] (7 pages)
* {{cite journal |first=Adrian |last=Duşa |date=2008-10-01 |orig-date=September 2007<!--|website=www.compasss.org Working Papers --> |title=A mathematical approach to the boolean minimization problem |journal=[[Quality & Quantity]] |volume=44 |pages=99–113 |doi=10.1007/s11135-008-9183-x |s2cid=123042755 |id=Article number: 99 (2010)}} [https://web.archive.org/web/20120313031147/http://www.compasss.org/files/WPfiles/Dusa2007.pdf] (22 pages)
* {{cite web |title=Enhancing Quine-McCluskey |first=Adrian |last=Duşa |location=[[University of Bucharest]] |date=2007 |url=http://www.compasss.org/wpseries/Dusa2007b.pdf |access-date=2020-05-12 |url-status=live |archive-url=https://web.archive.org/web/20200512134710/http://www.compasss.org/wpseries/Dusa2007b.pdf |archive-date=2020-05-12}} (16 pages) (NB.<!-- A series of two articles describing the algorithm(s) implemented in R. The R implementation is exhaustive and it offers complete and exact solutions. It processes up to 20 input variables. -->