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_20,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 Xref: utzoo comp.lang.c:39070 comp.lang.c++:13282 comp.lang.ada:5359 comp.lang.pascal:6598 Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!sdd.hp.com!think.com!snorkelwacker.mit.edu!apple!uokmax!munnari.oz.au!goanna!minyos.xx.rmit.oz.au!s872607 From: s872607@minyos.xx.rmit.oz.au (George Tzanatos) Newsgroups: comp.lang.c,comp.lang.c++,comp.lang.ada,comp.lang.pascal Subject: Re: Quinn-McClaskey Algorithm? Message-ID: <1991May7.101437.19522@minyos.xx.rmit.oz.au> Date: 7 May 91 10:14:37 GMT References: <91122.203356TAINT021@ysub.ysu.edu> <1991May3.114141.24913@newcastle.ac.uk> Organization: RMIT Computer Centre, Melbourne Australia. List-Id: D.M.Johnson@newcastle.ac.uk (Dave Johnson) writes: >TAINT021@ysub.ysu.edu (David M. Onder) writes: >>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..... >I would like this as well, e-mail address below Please add me to the list too.......s872607@minyos.xx.rmit.oz Thanks in advance.