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...
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Knjiga |
| Jezik: | Undetermined |
| Izdano: |
Berlin
Springer
2012
|
| Teme: | |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|