2010, ISBN: 3642083986
[EAN: 9783642083983], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; ALPHABET; BERECHNUNGSKOMPLEXITÄT; BERECHNUNGSMODELL; KOMPLEXITÄTSKLASSEN; SCHALTKREIS; ALGORITHMS;… Más…
| ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Gastos de envío:Versandkostenfrei. (EUR 0.00) Details... |
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) - Pasta blanda
2010, ISBN: 9783642083983
Springer Berlin Heidelberg, Taschenbuch, Auflage: Softcover reprint of hardcover 1st ed. 1999, 288 Seiten, Publiziert: 2010-02-19T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 29 black … Más…
| Amazon.de (Intern... |
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) - Pasta blanda
2010, ISBN: 9783642083983
Springer Berlin Heidelberg, Taschenbuch, Auflage: Softcover reprint of hardcover 1st ed. 1999, 288 Seiten, Publiziert: 2010-02-19T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 29 black … Más…
| Amazon.de (Intern... Gastos de envío:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) - Pasta blanda
2010, ISBN: 9783642083983
Springer, Paperback, Auflage: Softcover reprint of hardcover 1st ed. 1999, 283 Seiten, Publiziert: 2010-12-08T00:00:01Z, Produktgruppe: Book, Hersteller-Nr.: 29 black & white illustration… Más…
| amazon.co.uk |
ISBN: 9783642083983
paperback, [PU: Springer, Berlin/Heidelberg/New York, NY]
| Blackwells.co.uk |
2010, ISBN: 3642083986
[EAN: 9783642083983], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; ALPHABET; BERECHNUNGSKOMPLEXITÄT; BERECHNUNGSMODELL; KOMPLEXITÄTSKLASSEN; SCHALTKREIS; ALGORITHMS;… Más…
Vollmer, Heribert:
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) - Pasta blanda2010, ISBN: 9783642083983
Springer Berlin Heidelberg, Taschenbuch, Auflage: Softcover reprint of hardcover 1st ed. 1999, 288 Seiten, Publiziert: 2010-02-19T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 29 black … Más…
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) - Pasta blanda
2010
ISBN: 9783642083983
Springer Berlin Heidelberg, Taschenbuch, Auflage: Softcover reprint of hardcover 1st ed. 1999, 288 Seiten, Publiziert: 2010-02-19T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 29 black … Más…
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) - Pasta blanda
2010, ISBN: 9783642083983
Springer, Paperback, Auflage: Softcover reprint of hardcover 1st ed. 1999, 283 Seiten, Publiziert: 2010-12-08T00:00:01Z, Produktgruppe: Book, Hersteller-Nr.: 29 black & white illustration… Más…
Datos bibliográficos del mejor libro coincidente
| Autor: | |
| Título: | |
| ISBN: |
Detalles del libro - Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series)
EAN (ISBN-13): 9783642083983
ISBN (ISBN-10): 3642083986
Tapa dura
Tapa blanda
Año de publicación: 2010
Editorial: Springer Berlin Heidelberg
Libro en la base de datos desde 2011-02-23T02:03:19-06:00 (Mexico City)
Página de detalles modificada por última vez el 2024-02-14T03:36:59-06:00 (Mexico City)
ISBN/EAN: 9783642083983
ISBN - escritura alterna:
3-642-08398-6, 978-3-642-08398-3
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: vollmer, heribert
Título del libro: circuit, uniform, complexity
Datos del la editorial
Autor: Heribert Vollmer
Título: Texts in Theoretical Computer Science. An EATCS Series; Introduction to Circuit Complexity - A Uniform Approach
Editorial: Springer; Springer Berlin
272 Páginas
Año de publicación: 2010-12-08
Berlin; Heidelberg; DE
Impreso en
Idioma: Inglés
80,24 € (DE)
82,49 € (AT)
88,50 CHF (CH)
POD
XI, 272 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmus; Alphabet; Berechnungskomplexität; Berechnungsmodell; Komplexitätsklassen; Schaltkreis; algorithms; boolean circuits; complexity; complexity theory; computability; computational complexity; computational methods; linear algebra; logic; algorithm analysis and problem complexity; Theory of Computation; Algorithms; Formal Languages and Automata Theory; Computational Mathematics and Numerical Analysis; Electronics and Microelectronics, Instrumentation; Algorithmen und Datenstrukturen; Numerische Mathematik; Elektronik; BB; EA
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.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.
Más, otros libros, que pueden ser muy parecidos a este:
Último libro similar:
9780199079926 Marketing 5e (Prof. Charles W. Lamb; Prof. Joseph F. Hair; Prof. Carl McDaniel; Prof. Christo Boshoff; Prof. Nic Terblanche)
- 9780199079926 Marketing 5e (Prof. Charles W. Lamb; Prof. Joseph F. Hair; Prof. Carl McDaniel; Prof. Christo Boshoff; Prof. Nic Terblanche)
- 9780195993134 Marketing by Charles W. Lamb Paperback | Indigo Chapters
- 9780324006384 Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) (Vollmer, Heribert)
- 9780324125672 Marketing (Joseph F. HairCharles W. Lamb, Carl McDaniel,)
- Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) by Heribert Vollmer (1999-07-30) (Heribert Vollmer)
< para archivar...