Quine–McCluskey algorithm: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Removed proxy/dead URL that duplicated identifier. | Use this bot. Report bugs. | Suggested by BorgQueen | Category:CS1 ___location test | #UCB_Category 540/870
clean out implementation linkfarm per WP:EL
Line 239:
* {{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. --> [https://cran.r-project.org/web/packages/QCA/index.html QCA], an open source, R based implementation used in the social sciences.)
 
==External links==
* [http://quine-mccluskey-frederic-carpon-implementation.e-geii.eu Quine-McCluskey algorithm implementation with a search of all solutions], by Frédéric Carpon.
* [http://www.inf.ufrgs.br/logics/ Karċma 3], A set of logic synthesis tools including Karnaugh maps, Quine-McCluskey minimization, BDDs, probabilities, teaching module and more. Logic Circuits Synthesis Labs (LogiCS) - [[UFRGS]], Brazil.
* [http://accmdq.org/acc/bfunc/ BFunc], QMC based Boolean logic simplifiers supporting up to 64 inputs / 64 outputs (independently) or 32 outputs (simultaneously), by António Costa
* [[Python (programming language)|Python]] [http://cheeseshop.python.org/pypi/qm/0.2 Implementation] by Robert Dick, with an [http://shiftlock.wordpress.com/2011/05/17/quine-mccluskey-algorithm-implementation-in-python/ optimized version].
* [[Python (programming language)|Python]] [http://symlog.git.sourceforge.net/git/gitweb.cgi?p=symlog/symlog;a=blob_plain;f=symlog/logic.py;hb=HEAD Implementation] for symbolically reducing Boolean expressions.
* [http://sourceforge.net/projects/quinessence/ Quinessence], an open source implementation written in Free Pascal by Marco Caminati.
* [http://www.p0p0v.com/science/#_minBool minBool] an implementation by Andrey Popov.
* [http://www-ihs.theoinf.tu-ilmenau.de/~sane/projekte/qmc/embed_qmc.html QMC applet], an applet for a step by step analyze of the QMC- algorithm by Christian Roth
* [http://sourceforge.net/projects/qmcs C++ implementation] SourceForge.net C++ program implementing the algorithm.
* [https://metacpan.org/module/Algorithm::QuineMcCluskey Perl Module] by Darren M. Kulp.
* [http://sites.google.com/site/simpogical/download Tutorial] Tutorial on Quine-McCluskey and Petrick's method.
* [https://code.google.com/p/quine-mccluskey-petrick/source/browse/ Petrick] C++ implementation (including Petrick) based on the tutorial above.
* [http://sourceforge.net/projects/mini-qmc C program] Public Domain console based C program on SourceForge.net.
<!-- * George Vastianos. [http://www.seattlerobotics.org/encoder/200106/qmccmin.htm Boolean functions' minimisation software based on the Quine-McCluskey method]. ''Encoder''. -->
* For a fully worked out example visit: http://www.cs.ualberta.ca/~amaral/courses/329/webslides/Topic5-QuineMcCluskey/sld024.htm
* The Boolean Bot: A JavaScript implementation for the web: http://booleanbot.com/
* [http://sourceforge.net/projects/qmclm/ open source gui QMC minimizer]
* [https://arxiv.org/abs/1404.3349 Computer Simulation Codes for the Quine-McCluskey Method], by Sourangsu Banerji.
 
{{DEFAULTSORT:Quine-Mccluskey Algorithm}}