Title of article :
On the complexity of gate duplication
Author/Authors :
A.، Srivastava, نويسنده , , R.، Kastner, نويسنده , , M.، Sarrafzadh, نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
In this paper, we show that both the global and local gate duplication problems for delay optimization are NPcomplete under certain delay models
Journal title :
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
Journal title :
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
