| 期刊全称 | Boolean Function Complexity | | 期刊简称 | Advances and Frontie | | 影响因子2023 | Stasys Jukna | | 视频video | | | 发行地址 | 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 | | 学科分类 | Algorithms and Combinatorics | | 图书封面 |  | | 影响因子 | .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.. | | Pindex | Textbook 2012 |
The information of publication is updating
|
|
发表于 2025-3-21 18:42:36
