From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.1 required=5.0 tests=BAYES_40,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
Xref: utzoo comp.lang.c:38960 comp.lang.c++:13217 comp.lang.ada:5339 comp.lang.pascal:6541
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!dali.cs.montana.edu!uakari.primate.wisc.edu!crdgw1!uunet!stanford.edu!agate!usenet.ins.cwru.edu!ysub!taint021
From: TAINT021@ysub.ysu.edu (David M. Onder)
Newsgroups: comp.lang.c,comp.lang.c++,comp.lang.ada,comp.lang.pascal
Subject: Quinn-McClaskey Algorithm?
Message-ID: <91122.203356TAINT021@ysub.ysu.edu>
Date: 3 May 91 00:33:56 GMT
Organization: Youngstown State University VM system (YSUB)
List-Id: <comp.lang.ada>


I am looking for an implementation of the Quinn-McClaskey Algorithm for
minimizing a logical function.  I need this as soon as possible so if
anyone has information or the source, please e-mail me!  Thank you.....
:):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):)
                            David M. Onder
                YSU Computer Information Center Analyst
                  BITNET   : taint021 @ ysub.bitnet
      INTERNET : taint021 @ ysub.ysu.edu or sronder  @ macs.ysu.edu

           /--------------------------------------------\
           |  "Assume a virtue though you have it not"  |
           |           {William Shakespeare}            |
           \--------------------------------------------/