Zum Hauptinhalt springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Boolean Function Complexity
Advances and Frontiers
Buch von Stasys Jukna
Sprache: Englisch

115,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this ¿complexity Waterloö that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this ¿complexity Waterloö that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
Über den Autor
[...]
Zusammenfassung

This is the first book covering the happening in circuit complexity during the last 20 years

Includes non-standard topics, like graph complexity or circuits with arbitrary gates

Includes about 40 open problems as potential research topics for students ?

Includes supplementary material: [...]

Inhaltsverzeichnis
Part I Basics.- Part II Communication Complexity.- Part III Circuit Complexity.- Part IV Bounded Depth Circuits.- Part V Branching Programs.- Part VI Fragments of Proof Complexity.- A Epilog.- B Mathematical Background.- References.- Index.
Details
Erscheinungsjahr: 2012
Fachbereich: Nachrichtentechnik
Genre: Technik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Reihe: Algorithms and Combinatorics
Inhalt: xvi
620 S.
60 s/w Illustr.
ISBN-13: 9783642245077
ISBN-10: 3642245072
Sprache: Englisch
Herstellernummer: 80114248
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Jukna, Stasys
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Algorithms and Combinatorics
Maße: 241 x 160 x 40 mm
Von/Mit: Stasys Jukna
Erscheinungsdatum: 06.01.2012
Gewicht: 1,109 kg
Artikel-ID: 106784428
Über den Autor
[...]
Zusammenfassung

This is the first book covering the happening in circuit complexity during the last 20 years

Includes non-standard topics, like graph complexity or circuits with arbitrary gates

Includes about 40 open problems as potential research topics for students ?

Includes supplementary material: [...]

Inhaltsverzeichnis
Part I Basics.- Part II Communication Complexity.- Part III Circuit Complexity.- Part IV Bounded Depth Circuits.- Part V Branching Programs.- Part VI Fragments of Proof Complexity.- A Epilog.- B Mathematical Background.- References.- Index.
Details
Erscheinungsjahr: 2012
Fachbereich: Nachrichtentechnik
Genre: Technik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Reihe: Algorithms and Combinatorics
Inhalt: xvi
620 S.
60 s/w Illustr.
ISBN-13: 9783642245077
ISBN-10: 3642245072
Sprache: Englisch
Herstellernummer: 80114248
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Jukna, Stasys
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Algorithms and Combinatorics
Maße: 241 x 160 x 40 mm
Von/Mit: Stasys Jukna
Erscheinungsdatum: 06.01.2012
Gewicht: 1,109 kg
Artikel-ID: 106784428
Warnhinweis