分享给好友:
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics Stasys Jukna 2012 edition
价格
元 579
不含税
远程仓调货
预计送达时间 年6月8日 - 年6月18日
添加至iMusic心愿单
其他版本：
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics
Stasys Jukna
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. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science.
620 pages, biography
| 介质类型 | 图书 Paperback Book (平装胶订图书) |
| 已发行 | 2014年2月22日 |
| ISBN13 | 9783642431449 |
| 出版商 | Springer-Verlag Berlin and Heidelberg Gm |
| 页数 | 620 |
| 商品尺寸 | 155 × 235 × 36 mm · 949 g |
| 语言 | 德语 |
![Cover for Stasys Jukna · Tropical Circuit Complexity: Limits of Pure Dynamic Programming - SpringerBriefs in Mathematics (Paperback Book) [1st ed. 2023 edition] (2023)](https://imusic.com.cn/local-image/images/item/original/536/9783031423536.jpg?stasys-jukna-2023-tropical-circuit-complexity-limits-of-pure-dynamic-programming-springerbriefs-in-mathematics-paperback-book&class=scaled&v=1750215052)
![Cover for Stasys Jukna · Extremal Combinatorics: With Applications in Computer Science - Texts in Theoretical Computer Science. An EATCS Series (Paperback Book) [Second Edition 2011 edition] (2013)](https://imusic.com.cn/local-image/images/item/original/905/9783642269905.jpg?stasys-jukna-2013-extremal-combinatorics-with-applications-in-computer-science-texts-in-theoretical-computer-science-an-eatcs-series-paperback-book&class=scaled&v=1408487979)
![Cover for Stasys Jukna · Crashkurs Mathematik: Fur Informatiker - Leitf den Der Informatik (Paperback Book) [German, 2008 edition] (2007)](https://imusic.com.cn/local-image/images/item/original/163/9783835102163.jpg?stasys-jukna-2007-crashkurs-mathematik-fur-informatiker-leitf-den-der-informatik-paperback-book&class=scaled&v=1408609050)