Abstract
Many problems arising in CAD systems for VLSI design, such as layout computation and compaction as well as channel routing, can be reduced to the solution of a certain class of systems of linear inequalities. The complexity of the solution of such systems is studied. The results show that CAD systems manipulating merely the geometry of the layout without changing its topology can be efficiently implemented. However, systems that are also able to change the topology of the layout have to solve hard, i.e., NP-complete, problems.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call