Combinatorial Algorithms for Integrated Circuit Layout (Wiley Teubner Series on Applicable Theory in Computer Science)

Lengauer, Thomas

ISBN 10: 0471928380 / ISBN 13: 9780471928386

Edité par Wiley, 1990

Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority! N° de réf. du vendeur S_338607795

Synopsis :

The explosive growth of integrated circuitry has created a need for a one-stop reference source that combines practical with theoretical aspects of the subject. This work takes a major step in this direction by offering a unified compilation that will be useful for both practitioners and theoreticians interested in circuit layout. It presents an overview of what are currently the most important combinatorial problems in circuit layout and describes their solutions. Discussions cover algorithms currently used in layout systems, as well as some new algorithmic developments that hold promise of stimulating the improvement of layout systems in the future.

Présentation de l'éditeur: The explosive growth of integrated circuitry has created a need for a one–stop reference source that combines practical with theoretical aspects of the subject. This work takes a major step in this direction by offering a unified compilation that will be useful for both practitioners and theoreticians interested in circuit layout. It presents an overview of what are currently the most important combinatorial problems in circuit layout and describes their solutions. Discussions cover algorithms currently used in layout systems, as well as some new algorithmic developments that hold promise of stimulating the improvement of layout systems in the future.

Détails bibliographiques

Titre : Combinatorial Algorithms for Integrated ...
Éditeur : Wiley
Date d'édition : 1990
Reliure : Hardcover
Etat : Acceptable