募捐 9月15日2024 – 10月1日2024 关于筹款

The Complexity of Boolean Functions (Wiley-Teubner series...

The Complexity of Boolean Functions (Wiley-Teubner series in computer science)

Ingo Wegener
你有多喜欢这本书?
下载文件的质量如何?
下载该书,以评价其质量
下载文件的质量如何?
Presents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter includes exercises.
种类:
年:
1991
出版社:
Wiley
语言:
english
页:
469
ISBN 10:
3519021072
ISBN 13:
9783519021070
文件:
PDF, 1.94 MB
IPFS:
CID , CID Blake2b
english, 1991
线上阅读
正在转换
转换为 失败

关键词