Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/17/84; site bdaemon.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!ihnp4!houxm!whuxl!whuxlm!harpo!decvax!genrad!panda!talcott!harvard!seismo!hao!nbires!bdaemon!carl
From: carl@bdaemon.UUCP (carl)
Newsgroups: net.ai,net.wanted
Subject: Wanted: Algorithm for subsets
Message-ID: <290@bdaemon.UUCP>
Date: Mon, 15-Apr-85 14:40:26 EST
Article-I.D.: bdaemon.290
Posted: Mon Apr 15 14:40:26 1985
Date-Received: Thu, 18-Apr-85 05:27:58 EST
Distribution: net
Organization: Daemon Assoc., Boulder, CO
Lines: 14
Xref: watmath net.ai:2702 net.wanted:6213

A university friend is looking for an efficient algorithm for generating
subsets of a given set, minimizing repetition.

Please send replies by e-mail.  I will summarize and post responses.

Thanks in advance.

{allegra|amd|attunix|cbosgd|hao|ucbvax}!nbires!bdaemon!carl

Carl Brandauer
daemon associates, Inc.
1760 Sunset Blvd.
Boulder, CO 80302
303-442-1731