Boolean Function Complexity Advances and Frontiers /
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 hav...
שמור ב:
| מחבר ראשי: | |
|---|---|
| מחבר תאגידי: | |
| פורמט: | אלקטרוני ספר אלקטרוני |
| שפה: | English |
| יצא לאור: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| מהדורה: | 1st ed. 2012. |
| סדרה: | Algorithms and Combinatorics,
27 |
| נושאים: | |
| גישה מקוונת: | https://doi.org/10.1007/978-3-642-24508-4 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| סיכום: | 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. |
|---|---|
| תיאור פיזי: | XVI, 620 p. online resource. |
| ISBN: | 9783642245084 |
| ISSN: | 0937-5511 ; |