The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory 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
页:
470
ISBN 10:
3519021072
ISBN 13:
9783519021070
系列:
Wiley Teubner on Applicable Theory in Computer Science
文件:
PDF, 2.14 MB
IPFS:
,
english, 1991