Cantitate/Preț
Produs

Introduction to Circuit Complexity: A Uniform Approach: Texts in Theoretical Computer Science. An EATCS Series

Autor Heribert Vollmer
en Limba Engleză Hardback – 23 iun 1999

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 49268 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 8 dec 2010 49268 lei  6-8 săpt.
Hardback (1) 49592 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 23 iun 1999 49592 lei  6-8 săpt.

Din seria Texts in Theoretical Computer Science. An EATCS Series

Preț: 49592 lei

Preț vechi: 61989 lei
-20% Nou

Puncte Express: 744

Preț estimativ în valută:
9494 9868$ 7871£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540643104
ISBN-10: 3540643109
Pagini: 290
Ilustrații: XI, 272 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.5 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Texts in Theoretical Computer Science. An EATCS Series

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Lower undergraduate

Cuprins

1. Complexity Measures and Reductions.- 2. Relations to Other Computation Models.- 3. Lower Bounds.- 4. The NC Hierarchy.- 5. Arithmetic Circuits.- 6. Polynomial Time and Beyond.- Appendix: Mathematical Preliminaries.- A1 Alphabets, Words, Languages.- A2 Binary Encoding.- A3 Asymptotic Behavior of Functions.- A4 Turing Machines.- A5 Logic.- A6 Graphs.- A7 Numbers and Functions.- A8 Algebraic Structures.- A9 Linear Algebra.- List of Figures.- Author Index.

Textul de pe ultima copertă

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.

Caracteristici

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 at the end of each chapter Contains new material that has never before appeared in a textbook.