Book: The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
Author: Ingo Wegener
Pages: 470
Format: pdf
Language: English
ISBN10: 0471915556
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.
No comments:
Post a Comment