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 ha...
Đã lưu trong:
| 主要作者: | Jukna, Stasys |
|---|---|
| 格式: | 圖書 |
| 語言: | Undetermined |
| 出版: |
Berlin
Springer
2012
|
| 主題: | |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
相似書籍
-
The complexity of Boolean functions
由: Wegener, Ingor
出版: (2010) -
Dynamics of Complex Autonomous Boolean Networks
由: Rosin, David P
出版: (2015) -
Boolean Representations of Simplicial Complexes and Matroids
由: Rhodes, John, et al.
出版: (2015) -
Optimization techniques for solving complex problems
出版: (2009) -
Boolean Functions in Cryptology and
Information Security
由: Preneel, Bart, et al.
出版: (2013)