Boolean Function Complexity: Advances and Frontiers - Stasys Jukna
-30% koodiga BOOKS
Saadetis 12-18 tööpäeva jooksul
30-päevane tagastamisõigus
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 probl ... Täielik kirjeldus
Võib-olla meeldib sulle ka
Kirjeldus
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.
Lisateave
| Autor | Stasys Jukna |
|---|---|
| Kirjastaja | Springer Berlin Heidelberg |
| Series | Algorithms and Combinatorics |
| Väljalaskeaasta | 2014 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9783642431449 |