home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!spool.mu.edu!umn.edu!noc.msc.net!uc.msc.edu!apctrc!alasp46.hou.amoco.com!usasun47!zscv02
- From: scvalentine@hou.amoco.com (Steve Valentine)
- Newsgroups: comp.arch
- Subject: Re: Logic Minimization Algorithms
- Date: 15 Dec 1992 16:53:10 GMT
- Organization: Amoco
- Lines: 33
- Distribution: world
- Message-ID: <1gl2hmINN76h@alasp46.hou.amoco.com>
- References: <1992Dec15.024904.22554@amd.com>
- Reply-To: scvalentine@hou.amoco.com
- NNTP-Posting-Host: usasun47.hou.amoco.com
-
- In article 22554@amd.com, roberts@angelo.amd.com (Dave Roberts) writes:
- >
- >I couldn't think of a more appropriate news group to post this in, so
- >here goze:
- >[Lots deleted]
-
- Try comp.lsi.cad
-
- >So I guess my question is, how are these problems overcome? Do people
- >use other algorithms than Quine-McClusky instead that don't suffer
- >these problems? If so, what are they?
- >
- >Does someone have references of articles that describe this stuff?
- >Articles themselves?
- >
- >What about publicly available source code that implements the various
- >algorithms?
- >
- >Thanks for any help people can give to satisfy my curiousity.
- >
- >Dave Roberts
- >roberts@brahms.amd.com
-
- Again comp.lsi.cad - they recently posted their FAQ which should answer these
- questions.
-
- ---
- | Steve Valentine | My opinions are my own and not those of my |
- | Amoco Production Co | employer. |
- | 501 Westlake Park Boulevard | __o |
- | Houston, TX 77079 | \ > |
- | scvalentine@hou.amoco.com | (*)/ (*) |
-
-