书目名称 | Combinatorial Algorithms for Integrated Circuit Layout | 编辑 | Thomas Lengauer | 视频video | http://file.papertrans.cn/230/229890/229890.mp4 | 丛书名称 | XApplicable Theory in Computer Science | 图书封面 |  | 描述 | The last decade has brought explosive growth in the technology for manufac turing integrated circuits. Integrated circuits with several hundred thousand transistors are now commonplace. This manufacturing capability, combined with the economic benefits of large electronic systems, is forcing a revolution in the design of these systems and providing a challenge to those people in terested in integrated system design. Modern circuits are too complex for an individual to comprehend completely. Managing tremendous complexity and automating the design process have become crucial issues. Two groups are interested in dealing with complexity and in developing algorithms to automate the design process. One group is composed of practi tioners in computer-aided design (CAD) who develop computer programs to aid the circuit-design process. The second group is made up of computer scientists and mathemati‘::~l
s who are interested in the design and analysis of efficient combinatorial aJ::,orithms. These two groups have developed separate bodies of literature and, until recently, have had relatively little interaction. An obstacle to bringing these two groups together is the lack of books that | 出版日期 | Textbook 1990 | 关键词 | Quicksort; algorithms; approximation algorithm; complexity; computer; data structure; depth-first search; d | 版次 | 1 | doi | https://doi.org/10.1007/978-3-322-92106-2 | isbn_softcover | 978-3-322-92108-6 | isbn_ebook | 978-3-322-92106-2 | copyright | John Wiley & Sons Ltd 1990 |
The information of publication is updating
|
|