🚀 go-pugleaf

> 
> 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. 

> 
> Praveen> Well, isn't testing harder than designing ;-). Nobody has proved VLSI 
> Praveen> design to be an NP-complete problem (as far as I know)!
> 

> Hudli> That is not true. There is a mulititude of problems that are NP-complete
> Hudli> in physical design of VLSI, including placement, routing, pin assignment, etc. 

I should have specified it more clearly. I meant logic and functional
design. Yes, placement, routing etc. are NP-complete and are part of the
design process. But then I consider testing also to be an essential part of
VLSI design and the whole purpose of comparing design and test is lost. 

Thanks for pointing it out.

> Praveen> After all, the testing problem was NP-complete, is NP-complete 
> Praveen> and will be NP-complete!! 
               ^^^^^^^^^^^^^^^^^^^^

> Hudli>   ... until the question P = NP ? remains unresolved.

Or until the computer scientists/mathematicians give up:-) 

Praveen Vishakantaiah.

------------------------------------------------------------------------------
-- Microelectronics and Computer Technology Corporation, | Ph : (512)338-3736|
-- 3500 W. Balcones Center Drive                         | e-mail :          |
-- Austin, TX 78759.                                     | praveen@mcc.com   |
------------------------------------------------------------------------------
-- ALSO A HARD WORKING MEMBER OF :-)                     |
-- Computer Engineering Research Center,                 | Ph : (512)471-8013|
-- University of Texas, Austin.             e-mail : praveen@cerc.utexas.edu | 
-----------------------------------------------------------------------------