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