Boolean Function Complexity
Produktnummer:
1896dcd12688904e9595d9de33e400f4d5
| Autor: | Jukna, Stasys |
|---|---|
| Themengebiete: | Boolean functions circuit complexity combinatorics communication complexity information and communication, circuits lower bounds |
| Veröffentlichungsdatum: | 06.01.2012 |
| EAN: | 9783642245077 |
| Sprache: | Englisch |
| Seitenzahl: | 620 |
| Produktart: | Gebunden |
| Verlag: | Springer Berlin |
| Untertitel: | Advances and Frontiers |
Produktinformationen "Boolean Function Complexity"
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 Waterloo” 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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen