Abstract
In this paper, we show that both the global and local gate
duplication problems for delay optimization are NP-complete under
certain delay models
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.