The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science) PDF
470 Pages·1991·1.988 MB·English
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
Preview The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
Description:
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.
See more
The list of books you might like
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
