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.
Thể loại:
Năm:
1991
In lần thứ:
1
Nhà xuát bản:
Wiley
Ngôn ngữ:
english
Trang:
470
ISBN 10:
0471915556
ISBN 13:
9780471915553
File:
PDF, 1.99 MB
IPFS:
,
english, 1991