Complexity of Boolean Functions

Free Download

Authors:

Size: 2 MB (2406076 bytes)

Pages: 472/469

File format:

Language:

Publishing Year:

Wegener I.

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.

Reviews

There are no reviews yet.

Be the first to review “Complexity of Boolean Functions”
Shopping Cart
Scroll to Top