The Complexity of Graph Layour and Channel Routing for VLSI
| dc.contributor.author | Bhatt, Sandeep N. | en_US |
| dc.date.accessioned | 2023-03-29T15:11:56Z | |
| dc.date.available | 2023-03-29T15:11:56Z | |
| dc.date.issued | 1984-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149619 | |
| dc.description.abstract | This thesis is motivated by the need for a clearer understanding of various issues in VLSI layout. Within a formal setting, we identify critical properties of circuits that determine the quality of their layouts. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-351 | |
| dc.title | The Complexity of Graph Layour and Channel Routing for VLSI | en_US |
| dc.identifier.oclc | 16930313 |
