On Saturday 19 November 2005 20:51, Ted Harding wrote: > [..snip...] > There is bound to be a good algorithm out there somewhere > for finding a "minimal coveriung set" but I don't know it! > Best wishes to all, > Ted.
I found this presentation very explicit: http://www.cs.ualberta.ca/~amaral/courses/329/webslides/Topic5-QuineMcCluskey/sld079.htm Best wishes, Adrian -- Adrian DUSA Romanian Social Data Archive 1, Schitu Magureanu Bd 050025 Bucharest sector 5 Romania Tel./Fax: +40 21 3126618 \ +40 21 3120210 / int.101 ______________________________________________ R-help@stat.math.ethz.ch mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide! http://www.R-project.org/posting-guide.html
