| 书目名称 | Introduction to Circuit Complexity |
| 副标题 | A Uniform Approach |
| 编辑 | Heribert Vollmer |
| 视频video | |
| 概述 | Presents a broad view of the field covering all the fundamentals needed to study current research papers Introduces methods and results out of all main subareas..Extensive discussion of the literature |
| 丛书名称 | Texts in Theoretical Computer Science. An EATCS Series |
| 图书封面 |  |
| 描述 | This advanced textbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study..It begins with efficient Boolean circuits for problems with high practical relevance, e.g., arithmetic operations, sorting, and transitive closure, then compares the computational model of Boolean circuits with other models such as Turing machines and parallel machines. Examination of the complexity of specific problems leads to the definition of complexity classes. The theory of circuit complexity classes is then thoroughly developed, including the theory of lower bounds and advanced topics such as connections to algebraic structures and to finite model theory. |
| 出版日期 | Textbook 1999 |
| 关键词 | Algorithmus; Alphabet; Berechnungskomplexität; Berechnungsmodell; Komplexitätsklassen; Schaltkreis; algori |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-662-03927-4 |
| isbn_softcover | 978-3-642-08398-3 |
| isbn_ebook | 978-3-662-03927-4Series ISSN 1862-4499 Series E-ISSN 1862-4502 |
| issn_series | 1862-4499 |
| copyright | Springer-Verlag Berlin Heidelberg 1999 |
发表于 2025-3-21 19:50:31
