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ơ

相似書籍