Boolean Function Complexity:Advances and Frontiers(Algorithms and Combinatorics)

布尔函数的复杂性:进展与前沿

代数学

原   价:
1215.00
售   价:
972.00
优惠
平台大促 低至8折优惠
发货周期:预计8-10周发货
出  版 社
出版时间
2012年06月01日
装      帧
精装
ISBN
9783642245077
复制
页      码
620
开      本
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 48 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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 have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个