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:39084 comp.lang.c++:13302 comp.lang.ada:5364 comp.lang.pascal:6607
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!wuarchive!waikato.ac.nz!comp.vuw.ac.nz!am.dsir.govt.nz!robert
From: robert@am.dsir.govt.nz (Robert Davies)
Newsgroups: comp.lang.c,comp.lang.c++,comp.lang.ada,comp.lang.pascal
Subject: Re: Quinn-McClaskey Algorithm?
Message-ID: <1991May7.225307.28404@am.dsir.govt.nz>
Date: 7 May 91 22:53:07 GMT
References: <91122.203356TAINT021@ysub.ysu.edu> <1991May3.114141.24913@newcastle.ac.uk> <1991May7.101437.19522@minyos.xx.rmit.oz.au>
Organization: DSIR Applied Mathematics, Wellington, NZ
List-Id: <comp.lang.ada>

What is the Quinn-McClaskey Algorithm for minimising a logical function?