The NP-completeness of finding minimum area Layouts for VLSI-circuits (to appear)
Publication date
1982
Authors
Kramer, P.P.G.
van Leeuwen, Jan
Editors
Advisors
Supervisors
DOI
Document Type
Report
Metadata
Show full item recordCollections
License
Abstract
Keywords
Wiskunde en Informatica (WIIN), Ordered by external client
Citation
Kramer, P P G & van Leeuwen, J 1982, The NP-completeness of finding minimum area Layouts for VLSI-circuits (to appear). vol. 82-06, RUU-CS edn, Unknown Publisher, Utrecht. < http://www.cs.uu.nl/research/techreps/RUU-CS-82-06.html >