home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!olivea!hal.com!darkstar.UCSC.EDU!ararat!karplus
- From: karplus@ararat.ucsc.edu (Kevin Karplus)
- Newsgroups: comp.lsi.testing
- Subject: Re: Rise and shine
- Message-ID: <180rokINNkpp@darkstar.UCSC.EDU>
- Date: 1 Sep 92 22:44:36 GMT
- References: <1992Aug28.143621.1917@mcc.com> <1992Aug28.162856.23272@watson.ibm.com> <1992Aug31.145127.4912@mcc.com>
- Sender: karplus@ararat (Kevin Karplus)
- Organization: UC Santa Cruz CIS/CE
- Lines: 6
- NNTP-Posting-Host: ararat.ucsc.edu
-
- Logic minimization is also NP-hard.
-
- In fact, damn near any interesting design or testing teachnique is NP-hard (after all, that
- is what makes it interesting).
-
- Kevin
-