Stasys Jukna
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics Stasys Jukna

Name: Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics
Price: 780 CNY
Availability: OutOfStock
Author: Stasys Jukna

价格

元 780

不含税

远程仓调货

预计送达时间年6月11日 - 年6月23日

顾客评价：

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

根据欧洲消费者保护法享受14天退换货政策

Trustpilot平台高分认证

添加至iMusic心愿单

其他版本：

Paperback Book

2012 edition

(2014) 元 576

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.

621 pages, biography

介质类型	图书 Hardcover Book (精装硬皮书)
已发行	2012年1月6日
ISBN13	9783642245077
出版商	Springer-Verlag Berlin and Heidelberg Gm
页数	620
商品尺寸	165 × 242 × 39 mm · 1,08 kg
语言	德语