This specific ISBN edition is currently not available.View all copies of this ISBN edition:
An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 1999. HRD. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9783540643104
Book Description Springer, 1999. Hardcover. Condition: New. 1999. Seller Inventory # DADAX3540643109
Book Description Springer, 2018. Hardcover. Condition: New. Never used! This item is printed on demand. Seller Inventory # 3540643109
Book Description Springer, 2007. Condition: New. Seller Inventory # L9783540643104
Book Description Springer, 1999. Hardback. Condition: NEW. 9783540643104 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0340982
Book Description Springer Berlin Heidelberg 1999-06-23, Berlin |London, 1999. hardback. Condition: New. Seller Inventory # 9783540643104
Book Description Springer, 1999. Condition: New. book. Seller Inventory # M3540643109
Book Description Springer-Verlag Gmbh Jun 1999, 1999. Buch. Condition: Neu. Neuware - An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians. 270 pp. Englisch. Seller Inventory # 9783540643104
Book Description Springer Verlag, 1998. Hardcover. Condition: Brand New. 1st edition. 270 pages. 9.75x6.50x0.75 inches. In Stock. Seller Inventory # __3540643109
Book Description Springer. Condition: New. pp. xi + 270. Seller Inventory # 7528674