The Complexity of Boolean Functions
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.
年:
1987
出版社:
Johann Wolfgang Goethe-Universit¨at
语言:
english
页:
469
文件:
PDF, 1.88 MB
IPFS:
,
english, 1987