The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science) by Ingo Wegener

Product 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.
Product Details
Amazon Sales Rank: #1117167 in Books
Published on: 1991-01-15
Number of items: 1
Binding: Hardcover
470 pages