Xref: utzoo comp.sources.wanted:9944 comp.theory:136
Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!cs.utexas.edu!wuarchive!brutus.cs.uiuc.edu!usc!snorkelwacker!bloom-beacon!eru!luth!sunic!sics.se!sics.se!matsc
From: matsc@sics.se (Mats Carlsson)
Newsgroups: comp.sources.wanted,comp.theory
Subject: Bryant's algorithms
Message-ID: <MATSC.89Dec28113053@vishnu.sics.se>
Date: 28 Dec 89 10:30:53 GMT
Sender: news@sics.se
Distribution: comp
Organization: Swedish Institute of Computer Science, Kista
Lines: 12

I'm looking for an implementation of the algorithms described in the
reference below.  If anyone has such an implementation, preferably
ftp-able, please reply by e-mail or post.  Thanks.

R. E. Bryant, "Graph Based Algorithms for Boolean Function
Manipulation", IEEE Transactions on Computers, Vol. C-35, No. 8
(August 1986) pp. 677-691.

--
Mats Carlsson
SICS, PO Box 1263, S-164 28  KISTA, Sweden    Internet: matsc@sics.se
Tel: +46 8 7521543      Ttx: 812 61 54 SICS S      Fax: +46 8 7517230