The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
by Ingo Wegner
On This Page
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.Tags
Members
- Recently Added By
Author Information
8+ Works 61 Members
Classifications
Statistics
- Members
- 18
- Popularity
- 1,384,245
- Languages
- English
- Media
- Paper
- ISBNs
- 2
