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...

全面介绍

Saved in:
书目详细资料
主要作者: Jukna, Stasys. (Author, http://id.loc.gov/vocabulary/relators/aut)
企业作者: SpringerLink (Online service)
格式: 电子 电子书
语言: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
标签: 添加标签
没有标签, 成为第一个标记此记录!

相似书籍