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...
保存先:
| 第一著者: | Jukna, Stasys. (著者, http://id.loc.gov/vocabulary/relators/aut) |
|---|---|
| 団体著者: | SpringerLink (Online service) |
| フォーマット: | 電子媒体 eBook |
| 言語: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Extremal Combinatorics With Applications in Computer Science /
著者:: Jukna, Stasys., 等
出版事項: (2011) -
Storing and Transmitting Data Rudolf Ahlswede’s Lectures on Information Theory 1 /
著者:: Ahlswede, Rudolf., 等
出版事項: (2014) -
Transmitting and Gaining Data Rudolf Ahlswede’s Lectures on Information Theory 2 /
著者:: Ahlswede, Rudolf., 等
出版事項: (2015) -
Channel Coding Techniques for Wireless Communications
著者:: Deergha Rao, K., 等
出版事項: (2015) -
Wireless Communications
出版事項: (2007)



