The NP-completeness of finding minimum area Layouts for VLSI-circuits (to appear)

DSpace/Manakin Repository

The NP-completeness of finding minimum area Layouts for VLSI-circuits (to appear)
 
Kramer, P.P.G.; van Leeuwen, J.
(1982) Utrecht University Repository
(Report)
Download/Full Text
Open Access version via Utrecht University Repository Unknown
 
Keywords: Wiskunde en Informatica (WIIN), Ordered by external client
ISBN: 0924-3275
Publisher: Unknown Publisher
 
 
See more statistics about this item