home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lsi.testing
- Path: sparky!uunet!scifi!watson!norway.fishkill.ibm.com!raghu
- From: raghu@norway.fishkill.ibm.com (Raghu Hudli)
- Subject: Re: Rise and shine
- Sender: @watson.ibm.com
- Message-ID: <1992Aug28.162856.23272@watson.ibm.com>
- Date: Fri, 28 Aug 92 16:28:56 GMT
- Reply-To: raghu@vnet.ibm.com
- References: <1992Aug28.143621.1917@mcc.com>
- Organization: IBM Corp., E. Fishkill, NY
- Lines: 42
-
-
-
- In article <1992Aug28.143621.1917@mcc.com>, praveen@sirius.mcc.com
- (Praveen Vishakantaiah) writes:
- >
- >
- some stuff deleted....
-
- An interesting posting; however it elicits a couple of comments....
-
- >
- > Holger> I cannot imagine that everyone is interested in design
- > Holger> (comp.lang.vhdl, comp.lang.verilog, comp.sys.mentor, comp.lsi*),
- > Holger> but nobody in testing of all the stuff produced.
- >
- > Well, isn't testing harder than designing ;-). Nobody has proved VLSI
- > design to be an NP-complete problem (as far as I know)!
- >
-
- That is not true. There is a mulititude of problems that are NP-complete
- in physical design of VLSI, including placement, routing, pin assignment, etc.
-
- >
- > Rise and shine, all you testing folks. Spend some time posting useful
- > discussions pertaining to VLSI testing. Don't work too hard on the testing
- > problem [I hope my advisor does not see this:-)]. After all, the testing
- > problem was NP-complete, is NP-complete and will be NP-complete!!
- ^^^^^^^^^^^^^^^^^^^^
-
- ... until the question P = NP ? remains unresolved.
-
-
- > Praveen Vishakantaiah.
-
- Raghu Hudli
- -----------------------------------------------------------------------
- Raghu V. Hudli Tel: (914) 892-4188
- IBM Corporation Fax: (914) 892-4316
- E. Fishkill, NY email: raghu@vnet.ibm.com
- ------------------------------------------------------------------------
- Disclaimer: The opinions/views expressed here are mine and my employer
- does not necessarily concur with me.
-